a07.py

class Person: 
    def __init__(self, name, age, q_pos):
        self.name = name
        self.age = age
        self.q_pos = q_pos
        
    def get_priority(self):
        
        if self.age < 40:
            priority = 100 - self.q_pos
        elif self.age >= 40:
            priority = (100-self.q_pos) + 100
        
        return priority

    def __str__(self):
        priority = self.get_priority()
        return self.name + " " + str(priority)



def heapify(lst, n, node):
    largest = node
    pos1 = 2*node + 1
    pos2 = 2*node + 2

    if pos1<n and lst[pos1].get_priority() < lst[largest].get_priority():
        largest = pos1
        
    if pos2<n and lst[pos2].get_priority() < lst[largest].get_priority():
        largest = pos2
    
    if largest != node:
        lst[largest], lst[node] = lst[node], lst[largest]
        
        heapify(lst, n, largest)
        
        

def build_heap(lst):
    n = len(lst)
    
    for i in reversed(range(n//2)):
        heapify(lst, n, i)



def heap_sort(lst):
    n = len(lst)
    build_heap(lst)
    
    for i in reversed( range(n) ):
        lst[i], lst[0] = lst[0], lst[i]
        heapify(lst, i, 0)


if __name__ == '__main__': 
    p = Person('A', 24, 1) 
    print(p) # should output: A 99

    p = Person('A', 40, 1) 
    print(p) # should output: A 199
    
    people = [ 
        Person('A', 24, 1), 
        Person('B', 32, 2), 
        Person('C', 45, 3), 
        Person('D', 22, 4), 
        Person('E', 21, 5), 
        Person('F', 32, 6), 
        Person('G', 39, 7), 
        Person('H', 44, 8), 
        Person('I', 22, 9), 
        Person('J', 29, 10), 
        Person('K', 32, 11), 
        Person('L', 31, 12) 
    ]
    
    print([str(p)  for p in people])
    heap_sort(people) 
    print([str(p)  for p in people])
    # sould output: 
    # ['C 197', 'H 192', 'A 99', 'B 98', 'D 96', 'E 95', 'F 94', 'G 93', 'I 91', 'J 90', 'K 89', 'L 88']