Median of Data Stream - Priority Queue / Heap / Multiple Heaps

Problems
3

You can always pass the number to larger half, and only rebalance if the length of the larger half exceeds smaller half
class MedianOfStream:
def init(self):
self.larger_half=[] #min_heap
self.smaller_half=[]#max_heap
def add_number(self, num: float) → None:
# WRITE YOUR BRILLIANT CODE HERE
heappush(self.larger_half, num)
if len(self.larger_half) > len(self.smaller_half):
heappush(self.smaller_half, -1*heappop(self.larger_half))

def get_median(self) -> float:
    # ALSO HERE
    if len(self.larger_half) == len(self.smaller_half):
        return (self.larger_half[0]-self.smaller_half[0])/2
    else:
        return -1*self.smaller_half[0]