Cod sursa(job #2291766)
Utilizator | Data | 28 noiembrie 2018 16:53:58 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int poz[200003],n,op,m,i,x;
set<int> heap;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>op;
if(op==1)
{
m++;
f>>poz[m];
heap.insert(poz[m]);
}
else if(op==2)
{
int x;
f>>x;
heap.erase(poz[x]);
}
else if(op==3)
{
g<<*heap.begin()<<'\n';
}
}
return 0;
}