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