Submission #1157271

---

Source Code Expand

#include<iostream>
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<math.h>
#include<algorithm>
#include<iomanip>

using namespace std;



int main() {
	int n, ans = 0;
	long long c, k;
	vector<long long> t;
	cin >> n >> c >> k;
	t.resize(n);
	for (int i = 0; i < n; i++)
		cin >> t[i];

	sort(t.begin(), t.end());
	int i = 0;
	for (; i < n; i++) {
//cout << i << endl;
		for (int j = 1; j < c; j++) {
		//	cout << i + j << endl;
			if (i + j >= n) {
				ans++;
				i += j;
			//	cout << "A" << endl;
				break;
			}
			if (t[i + j] - t[i] <= k) {
				if (j == c - 1) {
					i += j;
					ans++;
			//		cout << "B" << endl;
					break;
				}
				continue;
			}
			else {
				ans++;
				i += j - 1;
			//	cout << "C" << endl;
				break;
			}
		}
	}

	cout << ans << endl;
//	cin >> n;

	return 0;
}

Submission Info

Judge Result