Cod sursa(job #2337801)
| Utilizator | Data | 6 februarie 2019 18:38:18 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <set>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> h;
int n,x,e,v[100000000],k,i;
int main()
{
f>>n;
k=1;
for(i=1;i<=n;i++)
{
f>>x;
if(x==1)
{
f>>e;
v[k++]=e;
h.insert(e);
}
if(x==2)
{
f>>e;
h.erase(v[e]);
}
if(x==3)
{
int el;
el= *h.begin();
g<<el<<"\n";
}
}
return 0;
}
