Cod sursa(job #2895379)
| Utilizator | Data | 29 aprilie 2022 00:52:53 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> sett;
int x, N, index, operatie,pozitie;
int main()
{
f>>N;
int v[N];
for(index=1; index<=N; index++)
{
f>>operatie;
if(operatie==1 || operatie==2)
{
if(operatie == 1)
{
f>>x;
v[++pozitie] = x;
sett.insert(x);
}
else
{
f>>x;
sett.erase(v[x]);
}
}
else
g<<*sett.begin()<<'\n';
}
f.close();
g.close();
return 0;
}
