POJ 3784 对顶堆动态维护中位数 解题报告

Running Median

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

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define MAX 10005

priority_queue<int,vector<int>,less<int> > a;    //大顶堆
priority_queue<int,vector<int>,greater<int> > b; //小顶堆
vector<int> c;

int main()
{
    int t,n,m,x;
    for(scanf("%d",&t);t;--t)
    {
        scanf("%d %d",&n,&m);
        while(!a.empty()) a.pop();
        while(!b.empty()) b.pop();
        c.clear();
        for(int i=0;i<m;i++) 
        {
            scanf("%d",&x);
            if(a.empty()) 
            {
                a.push(x);
                c.push_back(x);
                continue;
            }
            if(x<=a.top()) a.push(x);
            else b.push(x);
            while(a.size()>b.size()+1) 
            {
                b.push(a.top());
                a.pop();
            }
            while(a.size()<b.size()) 
            {
                a.push(b.top());
                b.pop();
            }
            if(i%2==0&&i!=0) c.push_back(a.top());
        }
        printf("%d %d\n",n,(m+1)/2);
        for(int i=0;i<c.size();i++) 
        {
            if(i>0&&i%10==0) putchar('\n');
            if(i%10) putchar(' ');
            printf("%d", c[i]);
        }
        printf("\n");
    }
    return 0;
}