Cod sursa(job #2876451)
| Utilizator | Data | 23 martie 2022 11:46:48 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.87 kb |
#include<set>
#include<fstream>
using namespace std;
set<int> myset;
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
fin>>n;
int cronologic=1;
int v[n+1];
for(int i=0;i<n;i++){
int operatie;
fin>>operatie;
switch(operatie){
case 1:
//inserare
int element;
fin>>element;
myset.insert(element);
v[cronologic++]=element;
break;
case 2:
//stergere element
int poz;
fin>>poz;
myset.erase(v[poz]);
break;
case 3:
//afiseaza minim
fout<<*myset.begin()<<"\n";
}
}
fout.close();
fin.close();
return 0;
}
