Submission #1156773

---

Source Code Expand

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

int main() {
  int N, C, K;
  vector<int> T;
  cin >> N >> C >> K;
  for (int i=0; i<N; i++) {
    int tmp;
    cin >> tmp;
    T.push_back(tmp);
  }
  sort(T.begin(), T.end());

  int ans = 1, c = 1, s = T[0], s_idx = 0;
  for (int i=1; i<N; i++) {
    if (T[i] - T[s_idx] <= K && c < C) {
      c++;
    } else {
      c = 1;
      ans++;
      s = T[i];
      s_idx = i;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result