二叉堆

#include <stdio.h>
#define N 100
int heap
,size=0;
void push(int x)
{
int i=size++;
while(i>0)
{
int j=(i-1)/2;
if(heap[j]<=x) break;
heap[i]=heap[j];
i=j;
}
heap[i]=x;
}

int pop()
{
int res=heap[0],t=heap[--size];
int i=0;
while(i*2+1<size)
{
int j=i*2+1;
if(j+1<size&&heap[j+1]<heap[j])
j++;
if(heap[j]>=t) break;
heap[i]=heap[j];
i=j;
}
heap[i]=t;
return res;
}

int main()
{
int x;
while(1)
{
scanf("%d",&x);
if(x==-1) break;
push(x);
}
while(size)
printf("%d%c",pop(),size==1? '\n':' ');
return 0;
}