Submission #2856850

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdlib>
#include<ctime>
using namespace std;
typedef long long ll;
int main() {
	int n, c, k, t[100010], ans = 0;
	cin >> n >> c >> k;
	for (int i = 0; i < n; i++)cin >> t[i];
	sort(t, t + n);
	pair<int, int>cnt;
	cnt.first;//time
	cnt.second = 0;//people
	for (int i = 0; i < n; i++) {
		if (!cnt.second) {
			cnt.first = t[i];
			cnt.second = 1;
			ans++;
		}
		else if (cnt.second == c || t[i] - cnt.first >= k) {
			cnt.first = t[i];
			cnt.second = 1;
			ans++;
		}
		else {
			cnt.second++;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result