Submission #2858608

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<cfloat>
using namespace std;
int mod = 1e9+7;

int main() {
  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());
  t.push_back(1e9+k+1);

  int tmp = t[0];
  int num = 0;
  int cnt = 0;
  for(int i=0; i<n; i++){
    num++;
    if( num == c || tmp + k < t[i+1] ){
      tmp = t[i+1];
      cerr << i << " " << t[i] << " " << num << endl;
      num = 0;
      cnt++;
    }
  }
  if( num > 0 ){
    cnt++;
  }
  cout << cnt << endl;

  return 0;
}

//

Submission Info

Judge Result