堆排序

def solve():
    def heapify(____):
        largest = i
        l = ____ * i + ____
        r = ____ * i + ____
        if l < n and lst[l] > lst[largest]:
            largest = l
        if r < n and lst[r] > lst[largest]:
            largest = r
        if largest != i:
            lst[i], lst[largest] = lst[largest], lst[i]
            heapify(____)
    lst = [____, ____, ____, ____, ____, ____]
    n = len(____)
    for i in range(____):
        heapify(____)
    for i in range(____):
        lst[____], lst[i] = lst[i], lst[____]
        heapify(____)
    print(____)