leetcode

0 class Solution {

1 public:

2 vector<int> getFinalState(vector<int> &nums, int k, int multiplier) {

3 using type_t = pair<int, int>;

4 priority_queue<type_t, vector<type_t>, greater<>> pq;

5 const int n = size(nums);

6

7 for (int i = 0; i < n; i++) {

8 pq.emplace(nums[i], i);

9 }

10

11 while (k--) {

12 const auto [val, idx] = pq.top();

13 pq.pop();

14 pq.emplace(val * multiplier, idx);

15 }

16

17 while (!pq.empty()) {

18 const auto [val, idx] = pq.top();

19 pq.pop();

20 nums[idx] = val;

21 }

22

23 return nums;

24 }

25 };