Submission #1996493

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1000000000000
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
using namespace std;

int main(){
	int n, c, k;
	cin >> n >> c >> k;
	int t[n];
	REP(i, n) cin >> t[i];
	sort(t, t+n);
	int ans = 1;
	int ct = t[0];
	int cp = 1;
	REP(i, n){
		if(ct + k < t[i] || cp > c){
			ans++;
			ct = t[i];
			cp = 1;
		}
		else cp++;
	}
	if(cp > c) ans++;
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result