Cod sursa(job #3132104)
Utilizator | Andrei Popa Haiducul | Data | 21 mai 2023 23:15:02 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in"); ofstream g("heapuri.out");
int n,a[200001],lg,val,tip_ex;
set<int> m;
int main()
{ f>>n;
for(int i=1; i<=n; ++i){
f>>tip_ex;
if(tip_ex == 3) g<<*m.begin()<<endl; /// afisare minim
else
{ f>>val;
if(tip_ex == 1) ///inserare
{ a[lg++] = val;
m.insert(val);
}
if(tip_ex == 2) m.erase(a[val-1]); ///stergere al x lea element
}
}
f.close();
g.close();
return 0;
}