UVALive 6906 A - Cluster Analysis

#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
#define PI acos((double)-1)
#define E exp(double(1))
#define K 1000+9
int a[K];
int main(void)
{
    int t,cs=1;cin>>t;
    while(t--)
    {
        int n,m,sum=1,x;
        cin>>n>>m;
        for(int i=1;i<=n;i++)
           scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        x=a[1];
        for(int i=1;i<=n;i++)
        {
            if(a[i]-x>m)
                sum++;
            x=a[i];
        }

        printf("Case #%d: %d\n",cs++,sum);
    }

    return 0;
}