Maximum Product After K Increments LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maximumProduct(vector<int> &nums, int k) {
4
    priority_queue<int, vector<int>, greater<int>> pq(nums.begin(), nums.end());
5

6
    while (k--) {
7
      int mini = pq.top();
8
      pq.pop();
9
      pq.push(mini + 1);
10
    }
11

12
    long long ans = 1, mod = 1e9 + 7;
13

14
    while (!pq.empty()) {
15
      ans = ((ans % mod) * (pq.top() % mod)) % mod;
16
      pq.pop();
17
    }
18

19
    return (int)ans;
20
  }
21
};