Submission #1156749

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#include<fstream>

#define rep(i,a,N) for(int i=0+a;i<N;i++)
#define lint long long int
#define SIZE 100005
#define pb push_back
#define MP make_pair

using namespace std;

int main(){
	vector<int> v;
	lint n,c,k;
	cin>>n>>c>>k;
	lint l;
	rep(i,0,n){
		cin>>l;
		v.push_back(l);
	}
	sort(v.begin(),v.end());
	lint st,count=0;
	bool TF=true;
	st=v[0];
	lint i=0,ans=1;
	while(i<n){
		if(st<=v[i]&&st+k>=v[i]&&count<c){
			i++;
			count++;
		}
		else{
			st=v[i];
			ans++;
			i++;
			count=1;
		}
	}
	cout<<ans;
return 0;
}

Submission Info

Judge Result