Submission #1157277

---

Source Code Expand

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

#include <numeric>
using namespace std;


int main(){
	int N,C,K;
	vector<int> T;
	cin >> N >> C >> K;
	for (int i = 0; i < N; i++){
		int inp;
		cin >> inp;
		T.push_back(inp);
	}
	std::sort(T.begin(), T.end());
	vector<vector<int>> v;
	int first = T[0]+K;
	vector<int> tmp;
	for (int i = 0; i < N; i++){
		if (T[i] <= first && tmp.size()<C){
			tmp.push_back(T[i]);
		}
		else if (tmp.size()==C ){
			v.push_back(tmp);
			tmp.clear();
			tmp.push_back(T[i]);
			first = T[i] + K;
		}
		else if(T[i]>first){
			v.push_back(tmp);
			tmp.clear();
			tmp.push_back(T[i]);
			first = T[i] + K;
		}

	}
	v.push_back(tmp);

	cout << v.size() << endl;



	return 0;
}

Submission Info

Judge Result