To see the question, click here.
Naive Approach
The idea is to store the elements in a list. At each stage of adding an element, we will sort the list because the elements may not be added to the list in a sorted fashion.
// TC: O(nlogn) for addNum a...
![Introduction to Heaps - Max Heap vs Min Heap [2024] Guide | Day #15](https://cdn.hashnode.com/res/hashnode/image/upload/v1728042094371/9fb67c96-0eaf-49c2-96c2-6f24552b689e.png)
