Min Operations (Bring Price Range Below d)

Given prices[n], integers k and d. Each op picks two indices (x, y) and a p ≤ k, then prices[x] += p, prices[y] -= p. Make max - min < d with minimum ops.

Constraints

• 1 ≤ n ≤ 10⁵
• 1 ≤ prices[i] ≤ 10⁹
• 1 ≤ k ≤ 10⁹
• 2 ≤ d ≤ 10⁹