POJ 1442 Black Box

　　优先队列水过~~~

　　

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <queue>

using namespace std;

int seq[30010];

int main()
{
    int n,m,i,j,order,top,lastorder;

    while(scanf("%d %d",&m,&n) != EOF)
    {

        priority_queue<int> q1;
        priority_queue<int ,vector<int>,greater<int> > q2;

        for(i = 0; i < m; ++i)
            scanf("%d",&seq[i]);

        lastorder = 0;

        top = 0;

        for(i = 0; i < n; ++i)
        {
            scanf("%d",&order);

            for(j = lastorder; j < order; ++j)
            {
                if(top < i+1)
                {
                    q1.push(seq[j]);
                    ++top;
                }
                else
                {
                    q2.push(seq[j]);
                }
            }

            lastorder = order;

            while(top < i+1)
            {
                ++top;
                q1.push(q2.top());
                q2.pop();
            }


            while(!q1.empty() && !q2.empty() && q1.top() > q2.top())
            {
                q1.push(q2.top());
                q2.push(q1.top());
                q1.pop();
                q2.pop();
            }
            printf("%d
",q1.top());
        }
    }
    return 0;
}