[AcWing 145] 超市

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

const int N = 1e6 + 10;

int n;

void solve()
{
    while (cin >> n) {
        vector<PII> products(n);
        for (int i = 0; i < n; i ++) {
            int p, d;
            cin >> p >> d;
            products[i] = {d, p};
        }
        sort(products.begin(), products.end());
        priority_queue<int, vector<int>, greater<int>> heap;
        for (auto [d, p] : products) {
            heap.push(p);
            if (heap.size() > d)
                heap.pop();
        }
        int res = 0;
        while (heap.size()) {
            res += heap.top();
            heap.pop();
        }
        cout << res << endl;
    }
}

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

    solve();

    return 0;
}