[ABC212D] Querying Multiset--优先队列

[ABC212D] Querying Multiset - 洛谷

 

#include <bits/stdc++.h>
#define int long long //(有超时风险)
#define PII pair<int,int>
#define endl '\n'
#define all(x) x.begin(), x.end()

using namespace std;

const int N=2e6+10,M=1e3+10,mod=998244353,INF=0x3f3f3f3f;

int a[N],b[N],pre[N];
int g[M][M];

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

    int n;cin>>n;
    priority_queue<int,vector<int>,greater<int>>q;

    int sum=0;
    for(int i=1;i<=n;i++)
    {
        int t;cin>>t;
        if(t==1)
        {
            int x;cin>>x;
            q.push(x-sum);
        }
        if(t==2)
        {
            int x;cin>>x;
            sum+=x;
        }
        if(t==3)
        {
            cout<<q.top()+sum<<endl;
            q.pop();
        }
    }

    return 0;
}