Submission #2847752

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;

int main()
{
    int n, c, k,ans=0;
    cin >> n >> c >> k;
    vector<int> t(n);
    rep(i, n) cin >> t[i];
    sort(t.begin(), t.end());
    int i = 0;
    while(i<n){
        int s = t[i] + k;
        int psg = 1;
        for (int j = 1; j < c && j + i < n; j++){
            if(s>t[i+j])
                psg++;
        }
        i += psg;
        ans++;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result