Submission #1157571

---

Source Code Expand

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

int check(int N, int C, int K, int* T)
{
	int bus_cnt = 0;
	int buf = 0;
	int pos = 0;

	sort(T, T + N);

	for (int i = 0; i < N; ++i) {
		if (buf == 0) {
			pos = i;
		}
		++buf;
		if (buf == C) {
			++bus_cnt;
			buf = 0;
			continue;
		}
		if (i == N - 1) {
			++bus_cnt;
			break;
		}
		if ((T[i + 1] >= T[pos] + K)) {
			++bus_cnt;
			buf = 0;
		}
	}

	return bus_cnt;
}

int main(void)
{
	int N, C, K;
	cin >> N >> C >> K;

	int* T = new int[N];	
	for (int i = 0; i < N; ++i) {
		cin >> T[i];
	}

	int ans = check(N, C, K, T);
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result