Cod sursa(job #1424066)
Utilizator | Data | 23 aprilie 2015 12:39:20 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<set>
using namespace std;
multiset <int> h;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int x,y,nr,v[200010],it,k,n,i;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>it;
if(it==1)
{
cin>>x;
h.insert(x);
v[++k]=x;
}
else if(it==2)
{
cin>>x;
h.erase(h.find(v[x]));
}
else
cout<<*h.begin()<<'\n';
}
return 0;
}