Cod sursa(job #2587188)
| Utilizator | Data | 22 martie 2020 13:51:33 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
int main () {
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
set <int> H;
vector <int> v;
int n, x, key;
fin >> n;
v.push_back(0);
for (; n; n--) {
fin >> key;
switch (key) {
case 1:
fin >> x;
H.insert(x);
v.push_back(x);
break;
case 2:
fin >> x;
H.erase(H.find(v[x]));
break;
default:
fout << *(H.begin()) << '\n';
break;
}
}
return 0;
}
