Submission #1157270

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <time.h>

using namespace std;
typedef long long ll;
#define pl pair<ll,ll>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define dbg(x) cout << #x"="<< (x) << endl
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a) 
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second

int main(){
	ll n,c,k,ans=0;
	cin>>n>>c>>k;
	vector<ll> t(n);
	rep(i,n)cin>>t[i];
	//今の時刻を取る.
	sort(all(t));

	ll now=t[0],wait=1;
	FOR(i,1,n){
		if(t[i]>now+k){
			now=t[i];
			wait=0;
			ans++;
		}
		wait++;
		if(wait==c){
			wait=0;
			ans++;
			if(i+1<n)now=t[i+1];
		}
	}
	if(wait!=0)ans++;
	cout<<ans<<endl;

    return 0;
}

Submission Info

Judge Result