Submission #1157272

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#define rep(i,a,b) for(int (i)=(a);i<(b);i++)
#define INF 100000000
#define MAX_N 1000000
using namespace std;

long long n,c,k;
long long t[MAX_N];

int main(){
    int ans=1;
    cin>>n>>c>>k;
    rep(i,0,n)cin>>t[i];
    sort(t,t+n);
    long long now=t[0],cos=0;
    for(int i=0;i<n;i++){
        //cout<<now+k<<" "<<cos<<endl;
        if(cos==c){
            ans++;
            now=t[i];
            c=0;
        }else if(now+k<t[i]){
            ans++;
            now=t[i+1];
        }
        cos++;
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result