Pagini recente » Cod sursa (job #2485924) | Cod sursa (job #416148) | Cod sursa (job #2263775) | Cod sursa (job #3248941) | Cod sursa (job #1034616)
#include <stdio.h>
int const N=200001;
int nh,h[N],poz[N],v[N];
void schimba(int a,int b)
{
int aux;
aux=h[a];
h[a]=h[b];
h[b]=aux;
}
void coboara(int p)
{
int fs=2*p,fd=2*p+1,bun=p;
if(fs<=nh && h[fs]<h[bun]) bun=fs;
if(fd<=nh && h[fd]<h[bun]) bun=fd;
if(bun!=p)
{
schimba(bun,p);
coboara(bun);
}
}
void urca(int p)
{
while(h[p]<h[p/2] && p>1)
{
schimba(p,p/2);
p/=2;
}
}
void adaug(int x)
{
h[++nh] = x;
urca(nh);
}
void sterg(int p)
{
schimba(nh--,p);
urca(p);
coboara(p);
}
int main()
{
int i,n,cod,elem;
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&cod);
if(cod != 3) scanf("%d",&elem);
if(cod == 1)
{
adaug(elem);
v[nh]=elem;
}
if(cod == 3) printf("%d\n",h[1]);
if(cod == 2)
}
for(i=1;i<=nh;i++)
printf("%d ",h[i]);
return 0;
}