Submission #1157617

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

using ll = long long;

ll t[100010] = {};

int main(void){
    // Here your code !
    
    ll n,c,k,res = 0;
    cin >> n >> c >> k;
    
    ll befor = 0;
    ll man = 0;
    
    for(int i = 0; i < n; i++){
        cin >> t[i];
    }
    
    sort(t,t+n);
    
    befor = t[0] + k;
    man = 1;
    res++;
    
    for(int i = 1; i < n; i++){
        //cout << res << " " << befor << endl;
        if(befor < t[i]){
            res++;
            man = 1;
            befor = t[i] + k;
        }else{
            
            if(man == c){
                res++;
                man = 0;
                befor = t[i] + k;
            }
            
            man++;
        }
        
    }
    
    cout << res << endl;
    
}

Submission Info

Judge Result