class MedianFinder
{
public:
    void addNum(int num) 
    {
        maxH.push(num);
        if (minH.empty() || (!maxH.empty() && minH.top() < maxH.top()) || maxH.size() > minH.size()) 
        {
            minH.push(maxH.top());
            maxH.pop();
        }
        if (minH.size() - 1 > maxH.size()) 
        {
            maxH.push(minH.top());
            minH.pop();
        }
    }
    
    double findMedian() 
    {
        if (minH.size() == maxH.size()) 
        {
            return double(minH.top() + maxH.top()) / 2.0;
        } 
        else 
        {
            return minH.top();
        }
    }
    
private:
    priority_queue<int, vector<int>, greater<int>> minH;
    priority_queue<int> maxH;
};