Spreading the Stations

**Bài toán.** n candidate positions on a line; choose k of them to maximize the minimum distance between any two chosen positions. **Constraints:** 2 ≤ k ≤ n ≤ 100000; 0 ≤ a[i] ≤ 10^9. **Output:** one integer — that maximized minimum distance.