提出 #74619436

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N, G, F;
    if (!(cin >> N >> G >> F)) return 0;

    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());

    priority_queue<long long> pq;
    long long current_pos = 0;
    long long fuel = F;
    int stops = 0;
    int idx = 0;

    while (current_pos + fuel < G) {
        while (idx < N && stations[idx].first <= current_pos + fuel) {
            pq.push(stations[idx].second);
            idx++;
        }

        if (pq.empty()) {
            cout << -1 << endl;
            return 0;
        }

        current_pos += fuel;
        fuel = pq.top();
        pq.pop();
        stops++;
    }

    cout << stops << endl;
    return 0;
}

提出情報

ジャッジ結果