Cod sursa(job #2861276)
| Utilizator | Data | 3 martie 2022 19:31:27 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.81 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int N=2e5+5;
multiset <int> h;
int poz[N],n;
int main()
{
int nrIntrebari;
in>>nrIntrebari;
for(int i=1;i<=nrIntrebari;i++)
{
int cod;
in>>cod;
switch(cod)
{
case 1:
{
int x;
in>>x;
poz[++n]=x;
h.insert(x);
break;
}
case 2:
{
int x;
in>>x;
h.erase(h.find(poz[x]));
break;
}
case 3:
{
out<<*h.begin()<<'\n';
break;
}
}
}
return 0;
}
