Cod sursa(job #625980)
| Utilizator | Data | 25 octombrie 2011 23:28:23 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
#include<set>
using namespace std;
int i,x,nr=0,tip,n,v[200001];
set<int> a;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>tip;
if(tip==1)
{
f>>x;
a.insert(x);
v[++nr]=x;
}
else
if(tip==2)
{
f>>x;
a.erase(v[x]);
}
else
if(tip==3)
g<<*a.begin()<<"\n";
}
return 0;
}