Пирамидальная сортировка по нескольким полям

class Student:
    def __init__(self, name, group, speciality, exam_date, mark):
        self.name = name
        self.group = group
        self.speciality = speciality
        self.exam_date = exam_date
        self.mark = mark
 
 
def heapify(arr, size, i):
    largest = i
    left = 2 * i + 1
    right = 2 * i + 2
 
    if left < size and arr[largest] < arr[left]:
        largest = left
    if right < size and arr[largest] < arr[right]:
        largest = right
 
    if largest != i:
        arr[i], arr[largest] = arr[largest], arr[i]
        heapify(arr, size, largest)
 
 
def heap_sort(arr):
    size = len(arr)
 
    for i in range((size // 2) - 1, -1, -1):
        heapify(arr, size, i)
 
    for i in range(size - 1, 0, -1):
        arr[i], arr[0] = arr[0], arr[i]
        heapify(arr, i, 0)
 
 
if __name__ == '__main__':
    students = [
        Student('Antony', 111, 121, '12.12.2022', 75),
        Student('Antony', 121, 153, '10.12.2022', 95),
        Student('Becca', 121, 153, '10.12.2022', 55)
    ]
    # make it work like here
    students.sort(key=lambda x: (x.name, -x.mark))
 
    for stud in students:
        print(f"{stud.name} - {stud.group} {stud.mark}")