Submission #1417223

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define PI 4*atan(1)
#define INF 1e8

int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};

typedef long long ll;

int main(){
  ll N, C, K;
  cin >> N >> C >> K;
  vector<ll> T(N);
  for(int i = 0; i < N; i++){
    cin >> T[i];
  }
  sort(T.begin(), T.end());
  ll ans = 0, l = 0, c = 0;
  for(int i = 0; i < N; i++){
    if(l < T[i]){
      ans++;
      c++;
      if(c == C){
        l = 0;
        c = 0;
      }else{
        l = T[i] + K;
      }
    }else{
      c++;
      if(c == C){
        l = 0;
        c = 0;
      }
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result