Leetcode 3266. Final Array State After K Multiplication Operations II

Repeatedly replace the leftmost minimum in nums with itself times multiplier for k operations and return the array modulo 1e9+7. The core challenge is handling very large k efficiently (n ≤ 1e4, k up to 1e9) by using a min-heap and batching repeated multiplications rather than simulating each step.