Submission #1156745

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second

ll n, c, k;
vector<ll> t;

int main() {
	cin >> n >> c >> k;
	t.resize(n);
	REP(i, n) {
		cin >> t[i];
	}
	sort(ALL(t));
	t.push_back(INF);
	ll num = t[0];
	ll ans = 0, cnt = 0;
	REP(i, t.size()) {
		if (t[i] - num <= k) {
			cnt++;
			if (cnt == c) {
				ans++;
				num = t[i + 1];
				cnt = 1;
			}
		}
		else {
			ans++;
			num = t[i];
			cnt = 1;
		}
	}
	//ans++;
	cout << ans << endl;
}

Submission Info

Judge Result