2530. Maximal Score After Applying K Operations
## 思路
MaxHeap取k次
## Code
```python
class Solution:
def maxKelements(self, nums: List[int], k: int) -> int:
res = 0
max_heap = []
for num in nums:
heapq.heappush(max_heap, -num)
for _ in range(k):
num = -heapq.heappop(max_heap)
res += num
heapq.heappush(max_heap, -ceil(num/3))
return res
```