Cod sursa(job #1821337)
Utilizator | Data | 2 decembrie 2016 22:34:34 | |
---|---|---|---|
Problema | Heapuri | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.86 kb |
#include <fstream>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int mom[200001],v[200001];
char bl[1000000001];
int main()
{
int n,i,op,x,vf=0,ult=0,aux,ok;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>op;
if(op<=2)
{
fin>>x;
if(op==1)
{
mom[++vf]=x;
if(bl[x]==1)
{
bl[x]=0;
}
else
{
ult++;
aux=ult;
while(x<v[aux/2] && aux!=1)
{
v[aux]=v[aux/2];
aux=aux/2;
}
v[aux]=x;
}
}
else
{
bl[mom[x]]=1;
}
}
else
{
while(bl[v[1]]==1)
{
bl[v[1]]=0;
v[1]=v[ult];
ult--; ok=1; aux=1;
while(ok==1)
{
ok=0;
if(aux*2>ult)
break;
if(v[aux]>v[aux*2])
{
swap(v[aux],v[aux*2]);
aux=aux*2;
ok=1;
}
else
{
if(aux*2+1>ult)
break;
if(v[aux]>v[aux*2+1])
{
swap(v[aux],v[aux*2+1]);
aux=aux*2+1;
ok=1;
}
}
}
}
fout<<v[1]<<'\n';
}
}
return 0;
}