Cod sursa(job #1263270)
Utilizator | Data | 14 noiembrie 2014 12:25:33 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <set>
#define NMax 200001
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, v[NMax], op, nr, el;
multiset <int> H;
int main()
{
f>>n;
for (int i=1; i<=n; i++) {
f>>op;
if (op==1) {
f>>v[++nr];
H.insert(v[nr]);
}
else if (op==2) {
f>>el;
H.erase(v[el]);
}
else
g<<*H.begin()<<"\n";
}
return 0;
}