Submission #1156779

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
using namespace std;
#define int long long

int T[1000010]={};
signed main() {
  int N,C,K;
  cin>>N>>C>>K;
  for(int i=0;i<N;i++) cin>>T[i];
  sort(T,T+N);
  int cnt=0,tmp=0;
  for(int i=0;i<(N-1);i++){
    if(abs(T[i+1]-T[i])<=K&&tmp<(C-1)){
      tmp++;
    }
    else{
       cnt++;
       tmp=0;
     }
  }
  cout<<cnt+1<<endl;
  return 0;
}

Submission Info

Judge Result