Submission #1418272

---

Source Code Expand

#include<iostream>
#include<vector>
#include<stack>
#include<algorithm>
#include<string>
#include<set>
#include<numeric>
#include<functional>
#include<unordered_map>
#include<cmath>
#include<cstdlib>

class Bus {
public:
	long long time, num;
};

int main()
{
	long long N, C, K;
	std::cin >> N >> C >> K;
	std::vector<long long> T(N);
	for (int i = 0; i < N; i++)
		std::cin >> T[i];
	//K時間まで, 定員C
	sort(T.begin(), T.end());
	long long counter = 1;
	Bus bus;
	bus.time = T[0];
	bus.num = 0;
	for (int i = 0; i < N; i++) {
		//乗せられるか判定
		if (bus.num < C && bus.time + K >= T[i]) {
			//乗せるだけ
			bus.num++;
		} else {
			//出発
			counter++;
			//printf("%d\n", i);

			//新しいバスを準備
			bus.time = T[i];
			bus.num = 1;
		}
	}
	std::cout << counter << std::endl;
}

Submission Info

Judge Result