Submission #1386534

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

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

  vector<int> t(n);
  for (int i = 0; i < n; i++) {
    cin >> t[i];
  }
  sort(t.begin(), t.end());

  int i = 0, st, cc, ans = 0;
  while (i < n) {
    cc = c;
    st = i;
    while (cc-- && t[i] <= t[st] + k && i < n) {
      i++;
    }
    ans++;
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result