Submission #1156417

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int N, C, K;
	vector<int> t;
	cin >> N >> C >> K;
	t.resize(N);
	for(int i=0;i<N;i++){
		cin >> t[i];
	}
	sort(t.begin(), t.end());

	int ans = 1;
	int i = 1;
	int passenger = 1;
	int first_time = t[0];
	while(i < t.size()){
		if(passenger < C && t[i] <= first_time + K){
			passenger++;
		}else{
			ans++;
			passenger = 1;
			first_time = t[i];
		}
		i++;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result