Hide

# Problem CBinary Heap

Your heap should have the time complexities $O(\log n)$ for the insert and remove operations, and $O(1)$ for the size and maximum operations.