堆排序模版

#include <iostream>
#include <cmath>
using namespace std;

int a[1020];

void fix(int a[], int i, int n)
{
    int l = 2 * i, r = 2 * i + 1, maxx = i;
    if (l <= n && a[l] > a[i])
    {
        maxx = l;
    }
    else{
        maxx = i;
    }
    if (r <= n && a[r] > a[maxx])
    {
        maxx = r;
    }
    if (maxx != i)
    {
        swap(a[i], a[maxx]);
        fix(a, maxx, n);
    }
}
void heap_sort(int a[], int n)
{
    for (int i = n / 2 - 1; i >= 0; i--)
    {
        fix(a, i, n - 1);
    }
    for (int i = n - 1; i >= 1; i--)
    {
        swap(a[0], a[i]);
        fix(a, 0, i - 1);
    }
}
int main()
{
    int n, m;
    while (cin >> n)
    {
        if (n == 0)break;
        cin >> m;
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        heap_sort(a, n);
        if (m == 0)
        {
            for (int i = 0; i < n - 1; i++)
            {
                cout << a[i] << " ";
            }
            cout << a[n - 1] << endl;
        }
        else{
            for (int i = n - 1; i > 0; i--)
            {
                cout << a[i] << " ";
            }
            cout << a[0] << endl;
        }
    }
    

    return 0;
}