Get Min Operations

Problem Overview

• Find the minimum number of operations needed to sort points by weight.
• n points at positions 1..n with weights[i]; one operation moves point i right by dist[i]; return a 64‑bit min count.
• Inputs: weights[n], dist[n]; Constraints: 2 ≤ n ≤ 2×10^5, weights ≤ 1e9, dist ≤ 10^3.
• Real‑world: designing a sorting method for x‑axis points.
• From Amazon interviews; a classic coding interview problem and interview question.