Cod sursa(job #2901182)
| Utilizator | Data | 13 mai 2022 10:42:00 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int main()
{
int n, i, instr, x, nr = 0;
fin>>n;
set <int> heapus;
int v[200001];
for(i = 0; i<n; i++)
{
fin>> instr;
if(instr==1)
{
fin>> x;
nr++;
v[nr] = x;
heapus.insert(x);
}
if(instr==2)
{
fin>> x;
heapus.erase(v[x]);
}
if(instr==3)
fout<< *heapus.begin() <<"\n";
}
return 0;
}