Cod sursa(job #2727861)
| Utilizator | Data | 22 martie 2021 16:08:59 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset <int> H;
int n,u,v[200001];
int main()
{
f>>n;
for(int tip,x;n;n--)
{ f>>tip;
switch(tip)
{
case 1 : f>>x; v[++u]=x; H.insert(x); break;
case 2 : f>>x; H.erase(H.find(v[x])); break;
case 3 : g<<*H.begin()<<'\n';
}
}
g.close();
f.close();
return 0;
}
