Cod sursa(job #2620857)
| Utilizator | Data | 29 mai 2020 19:37:27 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset <int> heap;
int n, loc ,v[200005];
int main()
{
int op, value;
f >> n;
for(int i=1; i <= n; i++)
{
f >> op;
if(op == 1)
{
f>>value;
heap.insert(value);
v[++loc] = value;
}
else if(op == 2)
{
f>>value;
heap.erase(v[value]);
}
else
{
g <<*heap.begin() << "\n";
}
}
return 0;
}
