Cod sursa(job #855794)
| Utilizator | Data | 15 ianuarie 2013 17:10:45 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <set>
using namespace std;
set <int> s;
int h[210000],i,cod,nr,e,n,a[210000];
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>cod;
if (cod==1) {f>>e;a[++nr]=e;s.insert(e);}
if (cod==2) {f>>e;s.erase(s.find(a[e]));}
if (cod==3) g<<*s.begin()<<'\n';
}
f.close();
g.close();
return 0;
}
