NC50439 tokitsukaze and Soldier

NC50439

思路：
一道思维题，其实还是比较好想的，跟CF上某次的C题比较类似，先排个序，再用优先队列暴力一下，一次for循环就能完事儿

代码附：

#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
using namespace std;
const int N = 1e5+10;
struct node
{
    int v,s;
    inline bool operator <(const node &a)const
    {
        return v>a.v;
    }
} soldier[N];
bool cmp(node l1,node l2)
{
    if(l1.s==l2.s)
        return l1.v<l2.v;
    return l1.s<l2.s;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    for(int i=0; i<n; ++i)
        cin>>soldier[i].v>>soldier[i].s;
    sort(soldier,soldier+n,cmp);
    priority_queue<node>qq;
    int now=0,ans=0;
    for(int i=n-1; i>=0; --i)
    {
        while(qq.size()>soldier[i].s)
        {
            now-=qq.top().v;
            qq.pop();
        }
        if(qq.size()==soldier[i].s)
        {
            if(qq.top().v<soldier[i].v)
            {
                now=now-qq.top().v+soldier[i].v;
                qq.pop();
                qq.push(soldier[i]);
            }
        }
        if(qq.size()<soldier[i].s)
        {
            qq.push(soldier[i]);
            now+=soldier[i].v;
        }
        ans=max(ans,now);
    }
    cout<<ans;
    return 0;
}