class Heap:


def __init__(self, items = []):

 self.items = items


def pop(self):

 #Build Max Heap

 n = len(self.items)

 for i in range((n-1)//2, -1, -1):

   self.sift_down(i)

   

 for i in range(n-1, 0, -1):

   #swap

   self.items[i], self.items[0] = self.items[0], self.items[i]

   self.sift_down(i)

 return self.items

   





 

def sift_down(self, i):

 largest = i 

 l = 2 * i +1

 r = 2 * i +2

 n = len(self.items)

 

 if l < n and self.items[i] < self.items[l]:

   largest = l 

   

 if r <n and self.items[l] < self.items[r]:

   largest = r

 

 if largest != i :

   self.items[i], self.items[largest] = self.items[largest], self.items[i]

   self.sift_down(largest)

   

   



 


def is_empty(self):

 if len(A):

   return False

 else:

   return True









A = [30, 6, 73, 29, 100, 80, -7, 206, 3]


heap = Heap(A)

B = []

#while not heap.is_empty():

B = [heap.pop()] + B

print(B)



여기서 틀린부분 찾을수있는새기 있냐 ?