Cod sursa(job #2415660)
Utilizator | Data | 26 aprilie 2019 13:38:22 | |
---|---|---|---|
Problema | Heapuri | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int intrat[200010],n,poz,i,c,x;
set <int> h;
int main()
{ poz=0;
f>>n;
for(i=1;i<=n;i++)
{
f>>c;
if(c<=2)
{
f>>x;
if(c==1)
{
h.insert(x);
poz++;
intrat[poz]=x;
}
else{
h.erase(h.find(intrat[x]));
}
}
else{
g<<*h.begin()<<'\n';
}
}
return 0;
}