Cod sursa(job #2746652)
| Utilizator | Data | 28 aprilie 2021 11:29:14 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> nrs;
int v[200001], last=1;
int main()
{
int n, i;
int op, x;
f>>n;
for(i=0;i<n;++i)
{
f>>op;
if(op==3)
{
g<<*nrs.begin()<<'\n';
}
else
{
f>>x;
if(op==1)
{
nrs.insert(x);
v[last]=x;
++last;
}
else
{
nrs.erase(v[x]);
}
}
}
g.close();
return 0;
}
