Submission #1436644

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
	int n,c,k;
	cin >> n >> c >> k;
	int t[n];
	for(int i=0;i<n;i++)
		cin >> t[i];
	sort(t,t+n);
	int cur=0,curl=t[0]+k,ans=1;
	for(int i=0;i<n;i++){
		if(t[i]<curl && cur<c){
			cur+=1;
		}
		else{
			cur=1;
			curl=t[i]+k;
			ans+=1;
		}
	}
	cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result