Cod sursa(job #2746069)
Utilizator | Data | 27 aprilie 2021 14:07:04 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int N, op, x, i, idx;
set <int> heap;
int v[200001];
int main()
{
f >> N;
idx = 1;
for (i = 0; i < N; i++)
{
f >> op;
if (op == 1)
{
f >> x;
heap.insert(x);
v[idx] = x;
idx++;
}
else if (op == 2)
{
f >> x;
heap.erase(v[x]);
}
else
g << *heap.begin() << endl;
}
}