Submission #1333698

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <fstream>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
typedef long long ll;

ll N,C,K;
vector<ll> T;

int main() {

	cin >> N >> C >> K;
	T.resize(N);
	REP(i,N) cin >> T[i];

	sort(T.begin(),T.end());
	reverse(T.begin(),T.end());

	ll ans = 0;
	ll cnt = 0;
	ll start = -1;
	REP(i,T.size()) {
		if(start == -1) {
			start = T[i];
			cnt++;
		} else if(start - T[i] > K) {
			start = T[i];
			cnt = 1;
			ans++;
		} else {
			cnt++;
		}
		if(cnt == C) {
			cnt = 0;
			start = -1;
			ans++;
		}
	}

	if(cnt > 0) ans++;

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result