Submission #2180108

---

Source Code Expand

#include <iostream>
#include<sstream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#define  mem memset(a,0,sizeof(a))

const int mo=1000000007;
const int inf=0x3f3f3f3f;

typedef long long ll;
using namespace std;

int main()
{
     cin.sync_with_stdio(false);
    int a[100005];
    int n,c,k;
    int num=0,ans=0;
    cin>>n>>c>>k;
    int i,j;
    int x,y;
    for(i=0;i<n;i++)
        cin>>a[i];
    sort(a,a+n);
    for(i=0;i<n;i++)
    {
        if(num==c)
        {
            num=0;
        }
        if(a[i]<x||a[i]>y)
        {
            num=0;
        }
        if(num==0)
        {
            num++;
            ans++;
            x=a[i];
            y=a[i]+k;
            //cout<<a[i]<<'*'<<x<<endl;
            //cout<<a[i]<<'/'<<num<<endl;
            continue;
        }
        if(a[i]>=x&&a[i]<=y)
        {
            num++;
            //cout<<a[i]<<'*'<<x<<endl;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result