Submission #68522200

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1;
const int N=1;
const int mod=998244353;
const int inf=0x3f3f3f3f;
int q,mx=10000;
priority_queue<int,vector<int>,greater<int> >p;
signed main(){
    cin>>q;
    while(q--){
        int op,x;
        cin>>op;
        if(op==1){
            cin>>x; p.push(x);
        }else{
            cout<<p.top()<<'\n';
            p.pop();
        }
    }
    return 0;
}

Submission Info

Judge Result