Cod sursa(job #2382406)
Utilizator | Data | 18 martie 2019 11:57:58 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> myset;
int v[200001],i,a,x,n,k;
int main()
{ f>>n;
k=0;
for(i=1;i<=n;i++){
f>>a;
if(a==3)
g<<*myset.begin()<<'\n';
else if(a==2){
f>>x;
myset.erase(v[x]);
}
else{
f>>x;
v[++k]=x;
myset.insert(x);
}
}
return 0;
}