分配工作站(Assigning Workstations) 题解

思路分析

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

参考代码

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    long long m;
    if (!(cin >> n >> m)) return 0;
    vector<pair<long long, long long>> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second;
    sort(a.begin(), a.end());
    priority_queue<long long, vector<long long>, greater<long long>> pq;
    int saved = 0;
    for (int i = 0; i < n; ++i) {
        long long arr = a[i].first, stay = a[i].second;
        while (!pq.empty() && pq.top() + m < arr) {
            pq.pop();
        }
        if (!pq.empty() && pq.top() <= arr) {
            pq.pop();
            ++saved;
        }
        pq.push(arr + stay);
    }
    cout << saved << "\n";
    return 0;
}