куча

#include <iostream>
#include <cmath>

using namespace std;

void sift (int *arr, int first, int last)

 {
  int j = first;
  int k = first*2+1;

  while (k <= last)
  {
    if (k < last && arr[k] < arr[k+1])
     k++; // больший сын
     if (arr[j] < arr[k])
     {
        swap(arr[j], arr[k]);
         j = k;
         k = k*2+1;
     }
   else break;
 }
}

void sort (int *arr, int razmer)
{
  for (int i = razmer/2; i >= 0; i--)
   sift (arr, i, razmer-1);

 for (int m = razmer-1; m >= 1; m--)
 {
   swap(arr[0], arr[m]);
   sift (arr, 0, m-1);
 }
}

int main()
{
  int n=0;
  cin >> n;

  int *arr = new int[n];

  for (int i=0; i<n; i++)
   cin >> arr[i];

  sort (arr, n);

  for (int i=0; i<n; i++)
   cout << arr[i] << " ";
}