Cod sursa(job #2784838)
| Utilizator | Data | 17 octombrie 2021 15:04:57 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <set>
using namespace std;
int n,v[200001],nr;
multiset<int> heap;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
int op;
fin>>op;
if(op==1)
{
int x;
fin>>x;
heap.insert(x);
v[++nr]=x;
}
else if(op==2)
{
int x;
fin>>x;
heap.erase(v[x]);
}
else
{
fout<<*heap.begin()<<"\n";
}
}
return 0;
}
