def get_median(self):
        l1 = len(self.min_h)
        l2 = len(self.max_h)
        m = (l1 + l2 - 1) / 2
        if (l1 + l2) % 2 == 1:
            if m == 1 - l2:
                return -self.max_h[0]
            elif m == l2:
                return self.min_h[0]
            raise Exception("not balanced")
        else:
            return (-self.max_h[0] + self.min_h[0]) / 2.0
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Find Median.py/DualHeap.get_median/swapped operands of `-`