Cod sursa(job #870987)
Utilizator | Data | 4 februarie 2013 11:29:53 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, A[1000005], cnt;
multiset<int> H;
int main()
{
int op, a;
f >> n;
for (int i = 1; i <= n; i++) {
f >> op;
if (op == 1) {
f >> a;
A[++cnt] = a;
H.insert(a);
} else if (op == 2) {
f >> a;
H.erase(A[a]);
} else {
g << *(H.begin()) << '\n';
}
}
return 0;
}