力扣2530.执行K次操作后的最大分数
-
move(nums)把nums移到queue里
-
push((x+2)/3) —— /3向上取整
-
class Solution {public:long long maxKelements(vector<int>& nums, int k) {//把nums移到queue里,从大到小排序priority_queue<int> pq(less<int>(),move(nums));long long ans=0;while(k--){int x = pq.top();pq.pop();ans += x;pq.push((x+2) / 3);}return ans;}};
)
