Cod sursa(job #2744790)
| Utilizator | Data | 25 aprilie 2021 03:54:49 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <set>
#include <fstream>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set<int> heap;
int poz[200000],n,op,x,cont=1;
int main()
{
fin>>n;
for(int i = 0; i < n; i++){
fin>>op;
switch (op){
case 1:
fin>>x;
poz[cont++] = x;
heap.insert(x);
break;
case 2:
fin>>x;
heap.erase(poz[x]);
break;
case 3:
fout<<*heap.begin()<<endl;
break;
}
}
fin.close();
fout.close();
return 0;
}
