Submission #1214812

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
typedef long long ll;
 
int main(){
 
    ll N,C,K; cin >> N >> C >> K;
    vector<ll> T(N);
    for(int i=0; i<N; i++ ) cin >> T[i];
    sort(T.begin(),T.end());
 
    int ans = 1;
    ll start = T[0];
    ll cnt = 0;
    for(int i=0; i<N; i++ ){
        if(T[i] > start+K){
            ans++;
            start = T[i];
            cnt = 0;
            goto nextf;
        }else{
            cnt++;
        }
        if(cnt == C){
            cnt = 0;
            ans++;
            start = T[i+1];
        }
        nextf:;
    }
 
    cout << ans << endl;
 
    return 0;
}

Submission Info

Judge Result