#include <bits/stdc++.h>
// #define int long long
#define LL long long
using namespace std;
const int N = 1e5 + 10;
int a[N], n, m;
bool check(int mid)
{
int cnt = 0, last = -2e9;
for (int i = 1; i <= n; i ++ )
{
if (a[i] - last >= mid)
{
cnt ++ ;
last = a[i];
}
}
return cnt >= m;
}
signed main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
{
cin >> a[i];
}
sort(a + 1, a + n + 1);
int l = 0, r = 1e9;
while (l < r)
{
int mid = (l + r + 1) >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
cout << r << endl;
return 0;
}