AGGRCOW  Aggressive cows
Farmer John has built a new long barn, with N (2 <= N <= 100,000)
stalls. The stalls are located along a straight line at positions
x1,...,xN (0 <= xi <= 1,000,000,000).
His C (2 <= C <= 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 wants 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?
Input
t – the number of test cases, then t test cases follows.
* Line 1: Two spaceseparated integers: N and C
* Lines 2..N+1: Line i+1 contains an integer stall location, xi
Output
For each test case output one integer: the largest minimum distance.
Example
Input:
1 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.
hide comments
adi123cm:
20210713 09:51:22
Not an easy problem don't worry if you get stuck


akshat047:
20210629 18:41:12
I made it ;) never thought of this 

nextman:
20210624 18:51:41
@shubh3082 does it matter weather it is 8 or 9


shubh3082:
20210614 21:54:05
according to the problem we have to maximize the distance between the cows.


astreak:
20210614 17:41:20
Quite an easy problem i don't know why people make so fuss about it.


rexfx:
20210613 14:50:07
Poorly worded, although a good problem.


av1choudhary:
20210529 04:40:28
If your code is completely correct in your compiler still getting error in this complier, watch : https://youtu.be/BrhLrMeU5JA 

av1choudhary:
20210526 17:21:35
The God Question of Binary Search, if you are stuck or getting error. watch both part of this video


mayank2120:
20210526 09:19:31
this problem was fun!! 

nigurjar:
20210512 12:01:49
@kimg but questions says "minimum distance between any two of them is as large as possible." so we have to maximise minimum distance. which can come at 5 if put at 9 
Added by:  Roman Sol 
Date:  20050216 
Time limit:  2s 
Source limit:  10000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  USACO February 2005 Gold Division 