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

58.题目内容：

代码及思路：

#include<functional>
#include<queue>
priority_queue<double> big_queue; //最大堆
priority_queue<double, vector<double>, greater<double> > small_queue; //最小堆
void addNum(int num)
{
	if(big_queue.empty())
	{
		big_queue.push(num);
		return;
	}
	if(big_queue.size()==small_queue.size())
	{
		if(num<big_queue.top())
		{
			big_queue.push(num);
		}
		else
		{
			small_queue.push(num);
		}
	}
	else if(big_queue.size()>small_queue.size())
	{
		if(num>big_queue.top())
		{
			small_queue.push(num);
		}
		else
		{
			small_queue.push(big_queue.top());
			big_queue.pop();
			big_queue.push(num);
		}
	}
	else if(big_queue.size()<small_queue.size())
	{
		if(num<big_queue.top())
		{
			big_queue.push(num);
		}
		else
		{
			big_queue.push(small_queue.top());
			small_queue.pop();
			small_queue.push(num);
		}
	}
}
double findMedian()
{
	if(big_queue.size()==small_queue.size())
	{
		return (big_queue.top()+small_queue.top())/2;
	}
	else if(big_queue.size()>small_queue.size())
	{
		return big_queue.top();
	}
	return small_queue.top();
}
//测试代码：
int main()
{
	MedianFinder M;
	int test[]={6,10,1,7,99,4,33};
	for(int i=0;i<7;i++)
	{
		M.addNum(test[i]);
		printf(“%lf\n”,M.findMedian());
	}
	return 0;
}