Cod sursa(job #2895442)
Utilizator | Data | 29 aprilie 2022 06:45:28 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int N, o, x, v[200001], index = 0, i;
multiset<int> h;
f>>N;
for (i = 0; i < N; ++i) {
f>>o;
if (o == 1) {
f>>x;
h.insert(x);
v[++index] = x;
} else if (o == 3) {
g<<*h.begin()<<endl;
} else {
f>>x;
h.erase(v[x]);
}
}
return 0;
}