You are given a 0-indexed array of integer nums and an integer k. Your task is to maximize a score through a series of operations. Initially, your score is set to 0.
In each operation:
Select an index i (where 0≤ i <nums.length).
Add the value of nums[i] to your score.
Replace nums[i] with ceil(nums[i] / 3).
Repeat this process exactly k times and return the highest score you can achieve.
The ceiling function ceil(value) is the least integer greater than or equal to value.
Constraints: