Cod sursa(job #2895558)
| Utilizator | Data | 29 aprilie 2022 11:13:50 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
# include <fstream>
# include <set>
# define NR 200005
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int i,n,tip,nr,x;
int a[NR];
int main ()
{
f>>n;
multiset <int> H;
for (i=1; i<=n; ++i)
{
f>>tip;
if (tip==1)
{
f>>a[++nr];
H.insert(a[nr]);
}
else if (tip==2)
{
f>>x;
H.erase (H.find(a[x]));
}
else
g<<*H.begin()<<endl;
}
return 0;
}
