3264-Final_State.cpp

class Solution {
public:
    vector<int> getFinalState(vector<int>& nums, int k, int multiplier) {
        int len = nums.size();

        // Min-heap priority queue for pairs
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> p;

        // Push all elements into the priority queue with their indices
        for (int i = 0; i < len; i++) {
            p.push({nums[i], i});
        }

        // Perform the k operations
        for (int i = 0; i < k; i++) {
            auto [x, y] = p.top(); // Decompose the top element
            p.pop();
            x = x * multiplier;    // Multiply the value
            p.push({x, y});        // Push the updated value back with the index
        }

        // Update the nums array based on the modified priority queue
        while (!p.empty()) {
            auto [x, y] = p.top(); // Decompose the top element
            nums[y] = x;           // Update the corresponding index in nums
            p.pop();
        }

        return nums;
    }
};