Submission #2010090

---

Source Code Expand

#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

//-----------------------------------------------------------------------------

int n;
ll c,k,t[100000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n>>c>>k;
	REP(i,n) cin>>t[i];
	sort(t,t+n);
	ll cnt=1,ans=1,T=t[0];
	FOR(i,1,n) {
		if(T+k>=t[i]) {
			if(cnt+1<=c) cnt++;
			else cnt=1,ans++,T=t[i];
		}
		else {
			cnt=1,ans++,T=t[i];
		}
	}
	cout<<ans<<endl;

	return 0;
}

Submission Info

Judge Result