#include <iostream>

using namespace std;

void duisort1(int a[],int i,int n)
{
    int large=i;
    int left=2*i+1,right=left+1;
    if(left<n&&a[left]>a[i])
        large=left;
    if(right<n&&a[right]>a[large])
        large=right;
    if(large!=i)
    {
        swap(a[large],a[i]);
        duisort1(a,large,n);
    }
}

void duisort2(int a[],int n)
{
    int i;
    for(i=n/2-1;i>=0;i--)
        duisort1(a,i,n);
    for(i=n-1;i>0;i--)
    {
        swap(a[i],a[0]);
        duisort1(a,0,i);
    }
}
int main()
{
    int a[]={9,5,1,3,4,7,5};
    duisort2(a,7);
    for(int i:a)
    {
        cout<<i;
    }
    return 0;
}