Cod sursa(job #898271)
| Utilizator | Data | 28 februarie 2013 09:41:05 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int i,j,n,x,y,v[2000001],k;
multiset <int> a;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
{
fin>>x;
if(x==1)
{
fin>>y;
a.insert(y);
v[++k]=y;
}
if(x==2)
{
fin>>y;
a.erase(v[y]);
}
if(x==3)
fout<<*a.begin()<<'\n';
}
return 0;
}
