Pagini recente » Cod sursa (job #886386) | Cod sursa (job #1940303) | Cod sursa (job #1329131) | Cod sursa (job #1314240) | Cod sursa (job #3330245)
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
int N; cin>>N;
vector<int> val(N+1);
vector<bool> deleted(N+1,false);
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
int idx=0;
for(int i=0;i<N;i++){
int op; cin>>op;
if(op==1){
int x; cin>>x;
++idx;
val[idx]=x;
pq.push({x,idx});
}else if(op==2){
int k; cin>>k;
deleted[k]=true;
}else{
while(!pq.empty() && deleted[pq.top().second]) pq.pop();
cout<<pq.top().first<<"\n";
}
}
return 0;
}