remove-stones-to-minimize-the-total.cpp

class Solution {
public:
    int minStoneSum(vector<int>& piles, int k) {
        priority_queue<int> pq;
        int sum = 0;

        for(int i = 0; i < piles.size(); i++){
            pq.push(piles[i]);
            sum += piles[i];
        }

        while(k--){
            int tp = pq.top();
            pq.pop();
            sum -= tp / 2;
            pq.push(tp - tp / 2);
        }

        return sum;
    }
};