Submission #2368803

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define FOR(i,a,b) for(int i =(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define REPS(i,n) for(int i=1;i<=(n);i++)
#define RREPS(i,n) for(int i=(n);i>0;i--)
#define mp make_pair
#define pb(a) push_back(a)
typedef long long ll;

int main(){
  int N,C,K;
  cin >> N >> C >> K;
  vector<int> T(N);
  REP(i,N) cin >> T[i];
  sort(T.begin(),T.end());
  int cnt = 1;
  int t = T[0];
  int ans = 1;
  REPS(i,N-1){
    if(cnt < C && T[i] - t <= K) cnt++;
    else{
      ans++;
      t = T[i];
      cnt = 1;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result