Maximum Bags With Full Capacity of Rocks LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maximumBags(vector<int> &capacity, vector<int> &rocks, int additionalRocks) {
4
    int res(0), n(size(rocks));
5
    priority_queue<int, vector<int>, greater<int>> pq;
6
    for (int i = 0; i < n; i++) pq.push(capacity[i] - rocks[i]);
7

8
    while (!pq.empty() and pq.top() <= additionalRocks) {
9
      // pq.top() returns bag with least space.
10
      additionalRocks -= pq.top();
11
      pq.pop();
12
      res++;
13
    }
14
    return res;
15
  }
16
};