Max-Min Placement

**Problem.** Each query: n k then n positions. Print the largest d with k chosen positions, consecutive gaps >= d. **Constraints:** 1 ≤ k ≤ n ≤ 200000; 0 ≤ p_i ≤ 10^9. The W uses a strict > in the feasibility check — fails on exact gaps.