Submission #1307155

---

Source Code Expand

#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int inf = 999999999;
const double pi = acos(-1);

#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())

ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}

///////////////////////////////////////////////////////////////////////////
int t[100005] = {};

int main(){
	int n,c,k;
	cin >> n >> c >> k;
	rep(i,0,n)cin >>t[i];
	sort(t,t+n);
	ull time =0;
	int i = 0,ans =0;

	while(i < n){
        time += t[i] + k;
        int cnt = 0;
        while((ull)t[i] <= time){
          //  cout << t[i] << " ";
            i++;
            cnt++;
            if(cnt >= c || i >= n)break;
        }
       // cout << endl;
        if(cnt > 0)ans ++;
	}

    cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result