题目
    题解

    1. class Solution {
    2. public:
    3.     priority_queue<int, vector<int>, greater<int>> minHeap;
    4.     priority_queue<int> maxHeap;
    5.     int count = 0;
    7.     void Insert(int num) {
    8.         count += 1;
    9.         maxHeap.push(num);
    10.         minHeap.push(maxHeap.top());
    11.         maxHeap.pop();
    12.         if (count & 1) {
    13.             maxHeap.push(minHeap.top());
    14.             minHeap.pop();
    15.         }
    16.     }
    18.     double GetMedian() {
    19.         if (count & 1) {
    20.             return maxHeap.top() ;
    21.         } else {
    22.             return (maxHeap.top() + minHeap.top()) * 1.0 / 2;
    23.         }
    24.     }
    26. };