安装服务 LA 4850

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 800000 + 10;
struct order {
    int s, t;
    bool operator < (const order & a) const {
        return s < a.s;
    }
}ord[maxn];
priority_queue<order>q;
bool cmp(const order &a, const order & b) {
    return a.t < b.t || (a.t == b.t && a.s < b.s);
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        for (int i = 0; i < n; ++i) {
            cin>>ord[i].s>>ord[i].t;
        }
        sort(ord, ord + n, cmp);

        while (!q.empty())q.pop();
        int cur = 0;
        for (int i = 0; i < n; ++i) {
            if (cur + ord[i].s <= ord[i].t) {
                q.push(ord[i]);
                cur += ord[i].s;
            }
            else {
                if (q.empty())continue;
                order u = q.top();
                if (u.s > ord[i].s) {
                    cur = cur - u.s + ord[i].s;
                    q.pop();
                    q.push(ord[i]);
                }
            }

        }
        printf("%d\n",q.size());
        if (t)puts("");
    }
    return 0;
}