Pagini recente » Cod sursa (job #2226762) | Cod sursa (job #2625164) | Cod sursa (job #2572897) | Cod sursa (job #379104) | Cod sursa (job #2299935)
#include <iostream>
#include <set>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int> h;
int place[200001];
int main()
{
int n,x,p,k=0;
f>>n;
for(int i=1;i<=n;++i)
{
f>>p;
if(p==1)
{
f>>x;
h.insert(x);
place[++k]=x;
}
else if(p==2)
{
f>>x;
h.erase(place[x]);
}
else{
g<<*h.begin()<<'\n';
}
}
return 0;
}