Submission #1156751

---

Source Code Expand

#include <string>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <iterator>
#include <cmath>

using namespace std;
typedef long long ll;

int main()
{
	int N, C, K;
	cin >> N >> C >> K;
	vector<int> T(N);
	for (int i = 0; i < N; i++) {
		cin >> T[i];
	}
	sort(T.begin(), T.end());
	int ans = 0;
	int k = 0;
	int c = 0;
	for (int i = 0; i < N; i++) {
		if (c == 0) {
			k = T[i];
		}
		if (T[i] < k + K) {
			c++;
			if (c >= C) {
				ans++;
				c = 0;
			}
		} else {
			ans++;
			k = 0;
			c = 0;
		}
	}
	ans++;
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result