1962. Remove Stones to Minimize the Total

class Solution {
public:
    int minStoneSum(vector<int>& piles, int k) {
        priority_queue<int>Max;
        for(int i=0;i<piles.size();i++) {
            Max.push(piles[i]);
        }
        for(int i=0;i<k;i++) {
            int val = Max.top(); 
            if(val%2!=0) 
                val++;
            val /= 2;
            Max.pop();
            Max.push(val);
        }

        int sum = 0;
        while(!Max.empty()) {
            sum += Max.top();
            Max.pop();
        }
        return sum;
    }
};