Cod sursa(job #2646240)
| Utilizator | Data | 31 august 2020 15:09:15 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| 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 o("heapuri.out");
set<int>v;
int pos[200005];
int n, k;
int x, j;
int main()
{
f >> n;
for (size_t i = 0; i < n; i++)
{
f >> k;
switch (k)
{
case 1:
f >> x;
v.insert(x);
pos[++j] = x;
break;
case 2:
f >> x;
v.erase(pos[x]);
break;
case 3:
cout << *v.begin();
break;
default:
break;
}
}
}