Submission #1533471

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <unordered_map>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using namespace std;
using LL = long long;


int main() {
	int n, c, k;
	cin >> n >> c >> k;
	vector<int> T;
	int t;
	for (int i = 0; i < n; i++) {
		cin >> t;
		T.emplace_back(t);
	}
	sort(T.begin(), T.end());
	int ans = 0;
	int count = 0;
	int firstpeople = 0;
	if (c == 1) {
		cout << n << endl;
	}
	else {
		for (int i = 0; i < n; i++) {
			if (count == 0) {
				ans++;
				count++;
				firstpeople = T[i];
			}
			if (T[i] <= firstpeople + k&&count < c) {
				count++;
			}
			else {
				ans++;
				count = 1;
				firstpeople = T[i];
			}
		}
		cout << ans << endl;
	}
}

Submission Info

Judge Result