Cod sursa(job #1663401)
Utilizator | Data | 25 martie 2016 22:34:16 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset<int> v;
int n,t,st[200001],i,x,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>t;
if(t==1)
{
fin>>x;
v.insert(x);
st[++k]=x;
}
else if(t==2)
{
fin>>x;
v.erase(v.find(st[x]));
}
else
{
multiset<int>::iterator i=v.begin();
fout<<*i<<"\n";
}
}
return 0;
}