在线求中位数（优先队列实现） POJ3784

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>

using namespace std;

priority_queue<int,vector<int>,greater<int> >pq2;
priority_queue<int> pq1;

int main()
{
    int T;
    cin>>T;
    int time;
    int m;
    while(T--)
    {
        while(!pq1.empty())
            pq1.pop();
        while(!pq2.empty())
            pq2.pop();
        int x;
        cin>>time>>m;
        cout<<time<<" "<<(m+1)/2<<endl;
        cin>>x;
        int mid=x;
        cout<<mid;
        for(int i=2;i<=m;i++)
        {
            cin>>x;
            if(x>mid)
                pq2.push(x);
            else
                pq1.push(x);
            if(i%2==1)
            {
                if(pq1.size()==(pq2.size()+2))
                {
                    pq2.push(mid);
                    mid=pq1.top();
                    pq1.pop();
                }
                else if((pq1.size()+2)==pq2.size())
                {
                    pq1.push(mid);
                    mid=pq2.top();
                    pq2.pop();
                }
                if(i%20==1)
                    cout<<mid;
                else
                    cout<<" "<<mid;
            }
            if(i%20==19)
                cout<<endl;
        }
        cout<<endl;
    }
    return 0;
}