代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=1005;
const int INF=0x3f3f3f3f;
int n;
int heap[maxn];
//给定一个点，从这个点开始向下搜索
void maxHeapify(int node)
{
    int left=2*node,right=2*node+1;
    int large=node;
    if(left<=n&&heap[left]>heap[large])
        {
            large=left;
        }
    if(right<=n&&heap[right]>heap[large])
       {
           large=right;
       }
    if(large!=node)
    {
        swap(heap[node],heap[large]);
        maxHeapify(large);
    }
}
//从下标最大的非叶节点开始递减寻找
void buildMaxheap()
{
    for (int i=n/2;i>=1;i--)
        maxHeapify(i);
}
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
        scanf("%d",&heap[i]);
    buildMaxheap();
    for (int i=1;i<=n;i++)
        printf("%d ",heap[i]);
    printf("\n");
    return 0;
}