Submission #1370291

---

Source Code Expand

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

const int N = 1e5 + 10;

int n, k, c, ans, cnt, a[N];

int main(){
	cin >> n >> c >> k;
	for(int i = 1; i <= n; ++ i){
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	int bg = -1;
	for(int i = 1; i <= n; ++ i){
		if(bg != -1 && (a[i] - bg > k || cnt == c)){
			bg = -1;
			cnt = 0;
		} 
		if(bg == -1) {
			bg = a[i];
			ans ++;
		}
		if(a[i] - bg <= k && cnt < c){
			cnt ++;
		}
	}
	cout << ans;
	return 0;
}

Submission Info

Judge Result