怎么回事

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int maxsiz=0,x[100001],cow[100001];
int i,j,k,l;
int C,N;
bool check()
{
    int lminsiz=9999999;
    for(i=1;i<=C-1;i++)
    {
        if(abs(x[cow[i]]-x[cow[i+1]])<=maxsiz)return false;
        else lminsiz=min(lminsiz,abs(x[cow[i]]-x[cow[i+1]]));
    }
    maxsiz=max(maxsiz,lminsiz);
    return true;
}
bool guess(int now,int left)
{
    if(left==0)return check();
    if(now>=N)return false;
    guess(now+1,left);
    cow[now]=cow[now-1]+1;
    guess(now+1,left-1);
    cow[now]=0;
    
}
int main()
{
    cin>>N>>C;
    for(k=1;k<=N;k++)cin>>x[k];
    sort(x+1,x+N);
    guess(1,C);
    cout<<maxsiz;
}