AcWing 145. 超市(优先队列)

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;

int n;

typedef pair<int,int> PII;


int main()
{
    while(cin>>n)
    {
        vector<PII>ve(n);
        for(int i=0;i<n;i++)
        {
            //scanf("%d%d",&ve[i].second,&ve[i].first);
            cin>>ve[i].second>>ve[i].first;
        }
        sort(ve.begin(),ve.end());
        priority_queue<int,vector<int>,greater<int>>heap;
        for(auto p:ve)
        {
            heap.push(p.second);
            if(heap.size()>p.first) heap.pop();
        }
        int ans=0;
        while(heap.size()) ans=ans+heap.top(),heap.pop();
        cout<<ans<<endl;
    }
    return 0;
}