We have seen how min$-$heaps can efficiently extract the smallest element efficiently and maintain the least element as we insert$/$delete elements. Similarly, max$-$heaps can maintain the largest element. In this exercise, we combine both to maintain the "median" element.