Submission #1156786

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <map>
#define REP(i, n) for(int i = 0; i < n; ++i)
#define RANGE(i, x, n) for(int i = x; i < n; ++i)
using namespace std;

int main()
{
    int N, C, K;
    cin >> N >> C >> K;
    vector<double> T(N, 0);
    vector<int> P(N, 0);
    REP(i, N) {
        cin >> T[i];
    }
    sort(T.begin(), T.end());
    int ans = 0, curp = 0;
    int bef = T[0] + K;
    REP(i, N) {
        if(T[i] <= bef) {
            ++curp;
            if(curp == C) {
                ++ans;
                curp = 0;
                if(i < N - 1) {
                    bef = T[i + 1] + K;
                }
            }
        }else {
            ++ans;
            curp = 0;
            bef = T[i] + K;
            --i;
        }
    }
    if(curp != 0) {
        ++ans;
    }
    cout << ans << endl;
}

Submission Info

Judge Result