C :

#include <stdio.h>
#include <stdlib.h>
#define maxn 5010
#define swap(A,B,C) (C)=(A),(A)=(B),(B)=(C)
int A[maxn];
int len;

void adjust_down(int index){
int temp;
for(int i = index,j = 2*index;j <= len; j=2*i) {
    if(A[j+1]>A[j] && j+1<=len)j++;
    if(A[i]<A[j]){
        swap(A[j],A[i],temp);
        i = j;
    }
    else break;
}
}

int main()
{
    while(scanf("%d",&len) != EOF) {
          for(int i = 1;i <= len; i++)scanf("%d",&A[i]);
          for(int i = len/2;i >= 1; i--)adjust_down(i);
          int N = len;
          while(len--){
            int temp;
            swap(A[1],A[len+1],temp);
            adjust_down(1);
          }
          for(int i = 1;i <= N; i++)printf("%d\n",A[i]);
    }
    return 0;
}

C++ :

#include <queue>
#include <iostream>
using namespace std;
priority_queue<int> q;
int main()
{
	int n;
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		int a;
		scanf("%d",&a);
		q.push(-a);
	}
	for (int i=1;i<=n;i++)
	{
		cout<<-q.top()<<endl;
		q.pop();
	}
	return 0;
}