/构造一个最大堆,然后反着输出去
#include<stdio.h>
int h[101];
int n;
void swap(int x, int y)
{
int t;
t = h[x];
h[x] = h[y];
h[y] = t;
}
void siftdown(int i)
{
int t, flag = 0;
while(i*2<=n && flag == 0)
{
if(h[i] < h[i*2])
t = i*2;
else t = i;
if(i*2+1<=n)
{
if(h[t] < h[2*i+1])
t = 2*i+1;
}
if(t!=i)
{
swap(t,i);
i = t;
}
else
flag = 1;
}
}
void creat()
{
int i;
for(i = n/2;i>=1;i--)
{
siftdown(i);
}
}
void headsort()
{
while(n>1)
{
swap(1,n);
n--;
siftdown(1);
}
}
int main()
{
int i, num, sum = 0, j = 1;
scanf("%d",&num);
for(i=1; i<=num; i++)
scanf("%d",&h[i]);
n = num;
creat();
headsort();
for(i = 1; i <= num; i++)
printf("%d ",h[i]);
}