C# 代码
public class Solution {
public long MaxKelements(int[] nums, int k) {
PriorityQueue<int, int> queue = new PriorityQueue<int, int>();
foreach (int num in nums){
queue.Enqueue(num, -num);
}
long result = 0;
while (k-- > 0){
int t = queue.Dequeue();
result += t;
t = (t + 2) / 3;
queue.Enqueue(t, -t);
}
return result;
}
}