Submission #1477244

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
signed  main(){
    int n,c,k; cin>>n>>c>>k;
    vi v(n,0); rep(i,n)cin>>v[i];
    sort(all(v));
    auto itr=v.begin();
    int key=v[0];
    int ans=0;
    while(true){
        ans++;
        auto next=lower_bound(itr, ((v.end()-(itr+c))>0?itr+c:v.end()),key+k+1);
        if(next==v.end())break;
        next--;
        itr=next;
        key=*itr;
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result