Sword To Offer 063 - 数据流中的中位数

class Solution {
private:
    int count = 0;
    priority_queue<int, vector<int>, greater<>> minHeap;
    priority_queue<int, vector<int>, less<>> maxHeap;
public:
    void Insert(int num) {
        if(count & 1) {
            minHeap.push(num);
            auto temp = minHeap.top();
            minHeap.pop();
            maxHeap.push(temp);
        } else {
            maxHeap.push(num);
            auto temp = maxHeap.top();
            maxHeap.pop();
            minHeap.push(temp);
        }
        count++;
    }

    double GetMedian() {
        if(count & 1) {
            return minHeap.top();
        } else {
            return (minHeap.top() + maxHeap.top()) / 2.0;
        }
    }
};