题目

大根堆很简单就解决了

cpp
class Solution {
public:
    int maximizeSum(vector<int>& nums, int k) {
        priority_queue<int>  maxHeap;
        for(int num: nums) maxHeap.push(num);
        int score = 0;
        while(k--) {
            int m = maxHeap.top();
            maxHeap.pop();
            score += m;
            maxHeap.push(m+1);
        }
        return score;

    }
};