heap

class BinHeap:
    def __init__(self):
        self.heap_list = [0]
        self.current_size = 0
    def perc_up(self, i):
        while i // 2 > 0:
            if self.heap_list[i] < self.heap_list[i // 2]:
                self.heap_list[i], self.heap_list[i // 2] = self.heap_list[i // 2], self.heap_list[i]
            i = i // 2
    def insert(self, k):
        from ipdb import set_trace
        set_trace()
        self.heap_list.append(k)
        self.current_size += 1
        self.perc_up(self.current_size)
    def perc_down(self, i):
        while (i * 2) <= self.current_size:
            mc = self.min_child(i)
            if self.heap_list[i] > self.heap_list[mc]:
                self.heap_list[i], self.heap_list[mc] = self.heap_list[mc], self.heap_list[i]
            i = mc
    # 返回左右结点小的那一个
    def min_child(self, i):
        if i * 2 + 1 > self.current_size:
            return i * 2
        else:
            if self.heap_list[i * 2] < self.heap_list[i * 2 + 1]:
                return i * 2
            else:
                return i * 2 + 1
    def del_min(self):
        # The first element is 0
        ret_val = self.heap_list[1]
        self.heap_list[1] = self.heap_list[self.current_size]
        self.current_size = self.current_size - 1
        self.heap_list.pop()
        self.perc_down(1)
        return ret_val
    def build_heap(self, a_list):
        i = len(a_list) // 2
        self.current_size = len(a_list)
        self.heap_list = [0] + a_list[:]
        while i > 0:
            self.perc_down(i)
            i = i - 1
class BinHeap():
    def __init__(self):
        self.list = []
        self.size = 0
    def upp(self, size):
        while size//2 > 0:
            if self.list[size//2-1] > self.list[size-1]:
                self.list[size//2-1], self.list[size-1] = self.list[size-1], self.list[size//2-1]
            size = size//2
    def insert(self, x):
        self.list.append(x)
        self.size += 1
        self.upp(self.size)