剑指63-数据流中的中位数

class Solution {
public:
    void Insert(int num)
    {
        res_vec.push_back(num);
        if (!res_vec.empty()) {
            int i = res_vec.size() - 1;
            for (i; i >= 1 && res_vec[i - 1] > num; i--)
            {
                res_vec[i] = res_vec[i - 1];
            }
            res_vec[i] = num;
        }
    }

    double GetMedian()
    {
        if (res_vec.empty()) return 0;
        return res_vec.size() % 2 ? res_vec[res_vec.size() / 2] : ((double)res_vec[res_vec.size() / 2 - 1] + (double)res_vec[res_vec.size() / 2]) / 2;
    }
private:
    vector<int> res_vec;
};