建筑抢修(Building Repair) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    if (!(cin >> n)) return 0;
    vector<pair<long long, long long>> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(), a.end());
    priority_queue<long long> pq;
    long long cur = 0;
    for (int i = 0; i < n; ++i) {
        long long t2 = a[i].first, t1 = a[i].second;
        cur += t1;
        pq.push(t1);
        if (cur > t2) {
            cur -= pq.top();
            pq.pop();
        }
    }
    cout << pq.size() << "\n";
    return 0;
}