Cod sursa(job #2388060)
Utilizator | Data | 25 martie 2019 17:04:57 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int>H;
int ord[200001],n,k=0,x;
int main()
{ f>>n;
for(int p,i=1;i<=n;i++)
{ f>>p;
if(p==1)
{ f>>x;
H.insert(x);
k++;
ord[k]=x;}
else
if(p==2)
{ f>>x;
H.erase(ord[x]);
}
else
g<<*H.begin()<<'\n';
}
f.close();
g.close();
}