**17 人解决**，17 人已尝试。

**20 份提交通过**，共有 40 份提交。

**3.7** EMB 奖励。

**单点时限: **1.0 sec

**内存限制: **256 MB

Farmer John has built a new long barn, with $N$ $(2 \leq N \leq 100~000)$ stalls. The stalls are located along a straight line at positions $x_1,\ldots,x_N$ $(0 \leq xi \leq 10^9)$.

His $C$ $(2 \leq C \leq N)$ cows don’t like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ want to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?

- Line $1$: Two space-separated integers: $N$ and $C$
- Lines $2$..$N+1$: Line $i+1$ contains an integer stall location, $x_i$

One integer: the largest minimum distance

Input

5 3 1 2 8 4 9

Output

3

OUTPUT DETAILS:

FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3.

Huge input data, scanf is recommended.

**17 人解决**，17 人已尝试。

**20 份提交通过**，共有 40 份提交。

**3.7** EMB 奖励。

题目标签