#include <iostream>
#include<bits/stdc++.h>

using namespace std;


bool check(vector<int> &arr,int k , int mid ){
	int cnt=1;
	int i=0;
	
	int n = arr.size();
	while(i<n){
		int j=i+1;
		while(j<n && arr[j]-arr[i]<mid){
			j++;
		}
	if(j<n && arr[j]-arr[i]>=mid){
		cnt++;
	}
		i=j;
	}
	
	return cnt>=k;
	// also use this 
// 	ll p = y[0];
//     ll c = 0 ; 
//     for(ll i=1;i<=n-1;i++){
//         ll diff = abs(p-y[i]);
//         if(diff>=g){
//             c++;
//             p = y[i];
//         }
//         else{
 
//         }
//     }
 
//     if(c+1>=k){
//         return true;
//     }
 
//     return false;
// }
	
}
int main() {
	// your code goes here
	int n,k;
	cin>>n>>k;
	vector<int> arr(n);
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	
	sort(arr.begin(),arr.end());
	int low=0;
	int high = arr[n-1]-arr[0];
	int ans = 0;
	
	while(low<=high){
		int mid = (low+high)/2;
		
		if(check(arr,k,mid)==true){
			ans=mid;
			low=mid+1;
			
		}
		else{
			high=mid-1;
		}
	}
	cout<<ans<<endl;
	
	return 0;
}