Pagini recente » Cod sursa (job #1028934) | Cod sursa (job #3294058) | Cod sursa (job #388018) | Cod sursa (job #236245) | Cod sursa (job #3285028)
#include <fstream>
#include <set>
#define nmax (int)(2e5+1)
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int p[nmax],n,k,x,task;
multiset<int>s;
signed main()
{
cin>>n;
while(n--){
cin>>task;
if(task!=3)
cin>>x;
if(task==1){
s.insert(x);
p[++k]=x;
}else if(task==2)
s.erase(s.find(p[x]));
else
cout<<*s.begin()<<'\n';
}
return 0;
}