Envío 1571

Código

import heapq

def down_heap(arr, index, length):
    left = (index + 1) * 2 - 1
    while left < length:
        if left < length and arr[left] > arr[left + 1]:
            left = left + 1
        if arr[index] > arr[left]:
            arr[index], arr[left], index = arr[left], arr[index], left
            left = (left + 1) * 2 - 1
        else:
            break

# def buildheap(arr):
#    length = len(arr)
#    for i in range(length // 2, 0, -1):
#        down_heap(arr, i - 1, length - 1)
#    print(arr)

def heapsort(arr):
    # buildheap(arr)
    heapq.heapify(arr)
    length = len(arr)
    for i in range(1, length):
        arr[0], arr[length - i] = arr[length - i], arr[0]
        down_heap(arr, 0, length - i - 1)
    arr.reverse()


if __name__ == "__main__":
    n = input()
    arr = list(map(int, input().split(" ")))
    heapsort(arr)
    print(" ".join(map(str, arr)))