#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,c;
int address[N],ans;
int check(int mid){
int last=0,sum=1;
for(int i=1;i<=n;i++){
if(address[i]-last>mid){
sum++;
last=address[i];
}
}
return sum;
}
int main(){
cin>>n>>c;
for(int i=1;i<=n;i++){
cin>>address[i];
}
sort(address+1,address+1+n);
int l=1,r=address[n]-address[1],mid;
while(l<r){
mid=(l+r+1)/2;
int t=check(mid);
if(t>=c){
l=mid;
}else{
r=mid-1;
}
}
cout<<l;
return 0;
}