Cod sursa(job #2369984)
Utilizator | Data | 6 martie 2019 10:06:49 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <set>
#define Nmax 200005
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, op, x, i;
int in[Nmax];
set <int> s;
int main()
{
f >> n;
while(n--)
{
f >> op;
if(op == 1)
{
f >> x;
in[++i] = x;
s.insert(x);
}
else if(op == 2)
{
f >> x;
s.erase(in[x]);
}
else
{
g << *s.begin() << '\n';
}
}
return 0;
}