Submission #1370382

---

Source Code Expand

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

typedef long long ll;
typedef pair <int, int> pii;

#define fr first
#define sc second
#define pb push_back
#define mpr make_pair
#define ppb pop_back()
#define ins insert
#define sz(s) int(s.size())
#define all(x) x.begin(), x.end()
#define lb lower_bound
#define ub upper_bound
int n, C, K, cnt, ans, a, last;
map <int, int> mp;
int main()
{
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> C >> K;
	for(int i = 1;i <= n; ++ i){
		cin >> a;
		++mp[a];
	}
	for(auto to : mp){
		if(to.fr > last + K){
			++ans;
			cnt = 0;
			last = to.fr;
		}
		cnt += to.sc;
		if(cnt > C){
			ans += (cnt - 1) / C;
			cnt = (cnt - 1) % C + 1;
			last = to.fr;
		}
	}
	cout << ans + 1;
	return 0;
}

Submission Info

Judge Result