Cod sursa(job #2965939)
| Utilizator | Data | 16 ianuarie 2023 16:35:43 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
int v[200005];
int k;
multiset <int> q;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
int t;
fin>>t;
if(t==1)
{
++k;
fin>>v[k];
q.insert(v[k]);
}
else if (t==2)
{
int x;
fin>>x;
q.erase(q.find(v[x]));
}
else
fout<<*q.begin()<<'\n';
}
}
