Cod sursa(job #3337526)
| Utilizator | Data | 28 ianuarie 2026 16:59:53 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define NMAX 200002
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
multiset<int> h;
int ord[NMAX];
int cat;
int main()
{
int i,cod,nr;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>cod;
if(cod==1)
{
fin>>nr;
h.insert(nr);
cat++;
ord[cat]=nr;
}
else
if(cod==2)
{
fin>>nr;
h.erase(h.find(ord[nr]));
}
else
fout<<*h.begin()<<'\n';
}
return 0;
}
