POJ-3784 对顶堆

Description
For this problem, you will write a program that reads in a sequence of 32-bit signed integers. After each odd-indexed value is read, output the median (middle value) of the elements received so far.
Input
The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. The first line of each data set contains the data set number, followed by a space, followed by an odd decimal integer M, (1 ≤ M ≤ 9999), giving the total number of signed integers to be processed. The remaining line(s) in the dataset consists of the values, 10 per line, separated by a single space. The last line in the dataset may contain less than 10 values.
Output
For each data set the first line of output contains the data set number, a single space and the number of medians output (which should be one-half the number of input values plus one). The output medians will be on the following lines, 10 per line separated by a single space. The last line may have less than 10 elements, but at least 1 element. There should be no blank lines in the output.

Sample Input
3
1 9
1 2 3 4 5 6 7 8 9
2 9
9 8 7 6 5 4 3 2 1
3 23
23 41 13 22 -3 24 -31 -11 -8 -7
3 5 103 211 -311 -45 -67 -73 -81 -99
-33 24 56
Sample Output
1 5
1 2 3 4 5
2 5
9 8 7 6 5
3 12
23 23 22 22 13 3 5 5 3 -3
-7 -3
笔记：
建立两个二叉堆，一个小根堆，一个大根堆。读入时设当前序列长度M,
维护：
1.序列中从小到大排名1~M/2 的数在大根堆
2.序列中从小到大排名M/2+1~M 的数在小根堆
当其中一个堆元素过多，则放入另一个堆
每次读入一个数X
If x < Small.top():
Big.push(x)
else:
small.push(x)

代码：

#include<iostream>
#include<queue>
using namespace std;
priority_queue<int>Big;
priority_queue<int,vector<int>,greater<int> >Small;
void Push(int x){
	if(Small.empty()||x>Small.top())Small.push(x);
	else Big.push(x);
	if(Big.size()>Small.size()+1)Small.push(Big.top()),Big.pop();
	if(Small.size()>Big.size()+1)Big.push(Small.top()),Small.pop();
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;cin>>t;
	while(t--){
		while(!Big.empty())Big.pop();
		while(!Small.empty())Small.pop();
		int m,n,tp;cin>>m>>n;
		cout<<m<<' '<<((n+1)>>1)<<'\n';
		for(int i=1;i<=n;++i){
			cin>>tp;
			Push(tp);
			if(i&1)cout<<(Small.size()>Big.size()?Small.top():Big.top())<<' ';
			if((i+1)%20==0&&i!=n)cout<<'\n';
		}
		cout<<'\n';
	}
	return 0;
}