Submission #1679832

---

Source Code Expand

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

struct Passenger{
    int n, t;
    bool operator<(const Passenger& obj)const{
        return t > obj.t;
    }
};

int main(){
    int n, c, k;
    cin >> n >> c >> k;

    priority_queue<Passenger> arr, ang;
    for(int i=0;i<n;++i){
        int t;
        cin >> t;
        arr.push((Passenger){i, t});
        ang.push((Passenger){i, t+k});
    }

    int ans = 0;
    while(!ang.empty()){
        Passenger p = ang.top(); ang.pop();
        arr.pop();
        int cnt = 1;
        while(!arr.empty() && arr.top().t <= p.t && cnt < c){
            arr.pop();
            ang.pop();
            cnt++;
        }
        ans++;
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result