Submission #1675985

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
int n,c,k,a[100010];

int main(){
	cin >> n >> c >> k;
	REP(i,0,n) cin >> a[i];
	
	sort(a,a+n);
	int ans=1,cou=1,tmp=a[0];
	REP(i,1,n){
		cou++;
		if(cou>c||a[i]-tmp>k){
			 ans++;
			 cou=1;
			 tmp=a[i];
		 }
	 }
		
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result