Submission #1156415

---

Source Code Expand

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

int main() {
    int n, c, k;
    cin >> n >> c >> k;

    priority_queue<int, vector<int>, greater<int>> que;
    for (int i = 0; i < n; i++) {
        int t;
        cin >> t;
        que.push(t);
    }

    int ans = 0;
    while (!que.empty()) {
        int first = que.top(),
            member = 0;
        while (!que.empty() && member < c && que.top() <= first + k) {
            que.pop();
            member++;
        }
        ans++;
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result