Cod sursa(job #1041114)
Utilizator | Data | 25 noiembrie 2013 15:35:25 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include<fstream>
#include<set>
using namespace std;
multiset<int>v;
int N,k,a[2000000],i,tip,val;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>N;
for(i=1;i<=N;i++)
{
f>>tip;
if(tip==1)
{
f>>val;
a[++k]=val;
v.insert(val);
}
else if(tip==2)
{
f>>val;
v.erase(a[val]);
}
else g<<*v.begin()<<'\n';
}
return 0;
}