Submission #1442175

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;

int main() {
    
    int N;
    long long C,K;
    long long ans = 0;
    long long last = 0;
    long long a = 0;
    vector<long long> T;
    
    cin >> N;
    cin >> C;
    cin >> K;
    
    for ( int i = 0; i < N; i++ ) {        
        long long t;
        cin >> t;
        
        T.push_back(t);
    }
    
    sort( T.begin(), T.end() );
    
    for ( auto& t : T ) {
        
        if ( !a ) {
            last = t;
            a = 1;
        }
        else {
            if ( a >= C || t-last > K ) {
                ans++;
                a = 1;
                last = t;
            }
            else {
                a++;
            }
        }
    }
    
    ans++;
    
    
    cout << ans << endl;
    
    return 0;
}

Submission Info

Judge Result