Cod sursa(job #1659543)
| Utilizator | Data | 22 martie 2016 12:21:23 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <set>
#include <cstdio>
#include <fstream>
using namespace std;
int ord[200001], i, n, nr1, x, v;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main() {
multiset <int> my_set;
f >> n;
for (i = 1; i <= n; i++) {
f >> v;
if (v == 1) {
f >> x;
nr1++;
ord[nr1] = x;
my_set.insert(x);
}
else if (v == 2) {
f >> x;
my_set.erase(ord[x]);
}
else {
multiset <int> :: iterator it = my_set.begin();
g << *it << "\n";
}
}
return 0;
}
