提出 #74618997

---

ソースコード 拡げる

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

int main() {
    long long N, G, F;
    cin >> N >> G >> F;
    
    vector<pair<long long,long long>> stations(N);
    for (int i = 0; i < N; i++)
        cin >> stations[i].first >> stations[i].second;
    sort(stations.begin(), stations.end());
    stations.push_back({G, 0});
    
    long long fuel = F;
    long long pos = 0;
    int stops = 0;
    priority_queue<long long> pq; 
    
    for (auto& [p, r] : stations) {
        long long dist = p - pos;
        fuel -= dist;
        while (fuel < 0) {
            if (pq.empty()) {
                cout << -1 << endl;
                return 0;
            }
            fuel += pq.top();
            pq.pop();
            stops++;
        }
        
        pos = p;
        if (r > 0) pq.push(r);
    }
    
    cout << stops << endl;
    return 0;
}

提出情報

ジャッジ結果