spoj297 AGGRCOW - Aggressive cows

AGGRCOW - Aggressive cows

#binary-search

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 space-separated 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.

#include <bits/stdc++.h>
using namespace std;
const int MAX=100005;
int n,c,a[MAX];
bool judge(int x)
{
	  int cnt=1,temp=a[0];
	  for(int i=0;i<n;i++)
	  {
	  	if(a[i]-temp>=x)
	  	{
	  		cnt++;
	  		temp=a[i];
	  	}
	  }
	  return cnt>=c;
}
void input()
{
	scanf("%d%d",&n,&c);
	for(int i=0;i<n;i++)
	 scanf("%d",a+i);
}
void solve()
{
	sort(a,a+n);
	int l=0,r=a[n-1]-a[0],mid;
	while(l<r)
	{
		mid=(l+r)/2;
		if(judge(mid))
		    l=mid+1;
		    else
		      r=mid;
	}
	if(!judge(l))
	  l--;
	  printf("%d\n",l);
}

int main() {
int T;
scanf("%d",&T);
while(T--)
{
	input();
	solve();
}
return 0;
}
}