Leetcode 3264. Final Array State After K Multiplication Operations I

Perform k repeated updates on nums where each step finds the current minimum element (choosing the first occurrence on ties) and replaces it with x * multiplier; return the final array. The core challenge is repeatedly selecting and updating the minimum while preserving index tie-breaking.