Submission #1357740

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
int N, C, K;
int Array[100005];
void Read()
{
    cin >> N >> C >> K;
    for(int i = 1; i <= N; i++)
        cin >> Array[i];
    sort(Array + 1, Array + N + 1);
}

void Solve()
{
    int cnt = 0, nb = 0, last = 0;
    for(int i = 1; i <= N; i++)
    {
        if(Array[i] > last || cnt == C)
        {
            ++nb;
            cnt = 1;
            last = Array[i] + K;
        }
        else
            ++cnt;
    }
    cout << nb << "\n";
}
int main()
{
    Read();
    Solve();
    return 0;
}

Submission Info

Judge Result