#include<bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(false) ; cin.tie(NULL)
const int N = 1e5 + 7;
int n , k;
long long a[N];
void inp(){
cin >> n >> k;
for (int i = 1 ; i <= n ; ++i){
cin >> a[i];
}
sort(a + 1 , a + n + 1);
}
bool check(long long p){
int cnt = 0;
long long can = a[1];
for (int i = 2 ; i <= n ; ++i){
if (a[i] - can < p) ++cnt;
else can = a[i];
}
return cnt <= k;
}
void solve(){
long long l = 1 , r = 1e10 , mid , res = 0;
while (l <= r){
mid = (l + r) >> 1;
if (check(mid)){
res = mid;
l = mid + 1;
}
else r = mid - 1;
}
cout << res;
}
int main(){
faster;
inp();
solve();
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBmYXN0ZXIgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSkgOyBjaW4udGllKE5VTEwpCgpjb25zdCBpbnQgTiA9IDFlNSArIDc7CmludCBuICwgazsKbG9uZyBsb25nIGFbTl07Cgp2b2lkIGlucCgpewogICAgY2luID4+IG4gPj4gazsKICAgIGZvciAoaW50IGkgPSAxIDsgaSA8PSBuIDsgKytpKXsKICAgICAgICBjaW4gPj4gYVtpXTsKICAgIH0KICAgIHNvcnQoYSArIDEgLCBhICsgbiArIDEpOwp9Cgpib29sIGNoZWNrKGxvbmcgbG9uZyBwKXsKICAgIGludCBjbnQgPSAwOwogICAgbG9uZyBsb25nIGNhbiA9IGFbMV07CiAgICBmb3IgKGludCBpID0gMiA7IGkgPD0gbiA7ICsraSl7CiAgICAgICAgaWYgKGFbaV0gLSBjYW4gPCBwKSArK2NudDsKICAgICAgICBlbHNlIGNhbiA9IGFbaV07CiAgICB9CiAgICByZXR1cm4gY250IDw9IGs7Cn0KCnZvaWQgc29sdmUoKXsKICAgIGxvbmcgbG9uZyBsID0gMSAsIHIgPSAxZTEwICwgbWlkICwgcmVzID0gMDsKICAgIHdoaWxlIChsIDw9IHIpewogICAgICAgIG1pZCA9IChsICsgcikgPj4gMTsKICAgICAgICBpZiAoY2hlY2sobWlkKSl7CiAgICAgICAgICAgIHJlcyA9IG1pZDsKICAgICAgICAgICAgbCA9IG1pZCArIDE7CiAgICAgICAgfQogICAgICAgIGVsc2UgciA9IG1pZCAtIDE7CiAgICB9CiAgICBjb3V0IDw8IHJlczsKfQoKaW50IG1haW4oKXsKICAgIGZhc3RlcjsKICAgIGlucCgpOwogICAgc29sdmUoKTsKICAgIHJldHVybiAwOwp9Cg==