Pagini recente » Cod sursa (job #1708611) | Cod sursa (job #830316) | Cod sursa (job #2701791) | Cod sursa (job #143704) | Cod sursa (job #3265265)
#include <fstream>
#include <set>
#define dim (int)(2e5+1)
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int q,n,task,x,v[dim];
multiset<int>s;
int main()
{
cin>>q;
while(q--){
cin>>task;
if(task==1){
cin>>x;
v[++n]=x;
s.insert(x);
}else if(task==2){
cin>>x;
s.erase(s.find(v[x]));
}else
cout<<*s.begin()<<'\n';
}
return 0;
}