Envío 5765

Código

length = int(input())

my_array = list(map(int, input().split()))


def heapify(my_array, length):
    i = length // 2 - 1
    while i >= 0:
        if i * 2 + 1 < length:
            if my_array[i] < my_array[i * 2 + 1]:
                my_array[i], my_array[i * 2 + 1] = my_array[i * 2 + 1], my_array[i]
        if i * 2 + 2 < length:
            if my_array[i] < my_array[i * 2 + 2]:
                my_array[i], my_array[i * 2 + 2] = my_array[i * 2 + 2], my_array[i]
        i -= 1


def heap_sort(my_array, length):
    if length:
        heapify(my_array, length)
        my_array[0], my_array[length - 1] = my_array[length - 1], my_array[0]
        heap_sort(my_array, length - 1)

heap_sort(my_array, length)

print(*my_array)