Submission #1156234

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 1e6;
int n, c, k;
int t[N + 7];
bool pokr[N + 7];

int main() {
	ios_base::sync_with_stdio(0);
	cin >> n >> c >> k;
	for(int i = 1; i <= n; ++i) {
		cin >> t[i];
	}
	sort(t + 1, t + n + 1);
	
	int wynik = 0;	
	for(int i = 1; i <= n; ++i) {
		if(!pokr[i]) {
			int xc = c;
			wynik++;
			for(int j = i; j <= n; ++j) {
				if(xc == 0 || t[j] - t[i] > k) break;
				pokr[j] = 1;
				xc--;
			}
		}
	}
	cout << wynik << endl;
	return 0;
}

Submission Info

Judge Result