1
class Solution {
2
 public:
3
  int minStoneSum(vector<int> &piles, int k) {
4
    priority_queue<int> pq;
5
    int sum = 0, curr;
6

7
    for (auto pile : piles) {
8
      pq.push(pile);
9
      sum += pile;
10
    }
11

12
    while (k--) {
13
      curr = pq.top();
14
      pq.pop();
15
      sum -= curr / 2;
16
      pq.push(curr - curr / 2);
17
    }
18

19
    return sum;
20
  }
21
};