数据流中的中位数_牛客题霸_牛客网
#include <algorithm>
#include <clocale>
#include <cstdio>
#include <vector>
class Solution {
public:
vector<int>data;
void Insert(int num) {
data.push_back(num);
}
double GetMedian() {
double Med = 0;
unsigned int len = data.size();
if(len%2 == 0)
{
sort(data.begin(), data.end());
Med = double(data[len/2] + data[len/2-1])/2;
}else {
sort(data.begin(), data.end());
Med = data[len/2];
}
return Med;
}
};