#include<iostream>
#include<algorithm>
using namespace std;
 
const int N=1e5+10;
typedef long long LL;
LL x[N];
LL n,m;
 
bool check(int d)
{
	int pos=1;
	int cnt=1;
	for(int i=1;i<=n;i++)
	{
		if(x[i]-x[pos]>=d)
		{
			pos=i;
			cnt++;
		}
	}
	return cnt>=m;
}
 
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>x[i];
	sort(x+1,x+n+1);
 
	int l=0,r=x[n]-x[1];
	while(l<r)
	{
		int mid=(l+r+1)/2;
		if(check(mid))
		{
			l=mid;
		}
		else
		{
			r=mid-1;
		}
	}
 
	cout<<l<<endl;
 
	return 0;
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBOPTFlNSsxMDsKdHlwZWRlZiBsb25nIGxvbmcgTEw7CkxMIHhbTl07CkxMIG4sbTsKCmJvb2wgY2hlY2soaW50IGQpCnsKCWludCBwb3M9MTsKCWludCBjbnQ9MTsKCWZvcihpbnQgaT0xO2k8PW47aSsrKQoJewoJCWlmKHhbaV0teFtwb3NdPj1kKQoJCXsKCQkJcG9zPWk7CgkJCWNudCsrOwoJCX0KCX0KCXJldHVybiBjbnQ+PW07Cn0KCmludCBtYWluKCkKewoJY2luPj5uPj5tOwoJZm9yKGludCBpPTE7aTw9bjtpKyspY2luPj54W2ldOwoJc29ydCh4KzEseCtuKzEpOwoJCglpbnQgbD0wLHI9eFtuXS14WzFdOwoJd2hpbGUobDxyKQoJewoJCWludCBtaWQ9KGwrcisxKS8yOwoJCWlmKGNoZWNrKG1pZCkpCgkJewoJCQlsPW1pZDsKCQl9CgkJZWxzZQoJCXsKCQkJcj1taWQtMTsKCQl9Cgl9CgkKCWNvdXQ8PGw8PGVuZGw7CgkKCXJldHVybiAwOwp9

NSAzCjEKMgo4CjQKOQo=

5 3
1
2
8
4
9