POJ 1442Black Box(优先队列)

Black Box

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 11966		Accepted: 4908

Description

Our Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i equals 0. This Black Box processes a sequence of commands (transactions). There are two types of transactions:

ADD (x): put element x into Black Box;
GET: increase i by 1 and give an i-minimum out of all integers containing in the Black Box. Keep in mind that i-minimum is a number located at i-th place after Black Box elements sorting by non- descending.

Let us examine a possible sequence of 11 transactions:

Example 1

N Transaction i Black Box contents after transaction Answer 

      (elements are arranged by non-descending)   

1 ADD(3)      0 3   

2 GET         1 3                                    3 

3 ADD(1)      1 1, 3   

4 GET         2 1, 3                                 3 

5 ADD(-4)     2 -4, 1, 3   

6 ADD(2)      2 -4, 1, 2, 3   

7 ADD(8)      2 -4, 1, 2, 3, 8   

8 ADD(-1000)  2 -1000, -4, 1, 2, 3, 8   

9 GET         3 -1000, -4, 1, 2, 3, 8                1 

10 GET        4 -1000, -4, 1, 2, 3, 8                2 

11 ADD(2)     4 -1000, -4, 1, 2, 2, 3, 8   

It is required to work out an efficient algorithm which treats a given sequence of transactions. The maximum number of ADD and GET transactions: 30000 of each type.


Let us describe the sequence of transactions by two integer arrays:


1. A(1), A(2), ..., A(M): a sequence of elements which are being included into Black Box. A values are integers not exceeding 2 000 000 000 by their absolute value, M <= 30000. For the Example we have A=(3, 1, -4, 2, 8, -1000, 2).

2. u(1), u(2), ..., u(N): a sequence setting a number of elements which are being included into Black Box at the moment of first, second, ... and N-transaction GET. For the Example we have u=(1, 2, 6, 6).

The Black Box algorithm supposes that natural number sequence u(1), u(2), ..., u(N) is sorted in non-descending order, N <= M and for each p (1 <= p <= N) an inequality p <= u(p) <= M is valid. It follows from the fact that for the p-element of our u sequence we perform a GET transaction giving p-minimum number from our A(1), A(2), ..., A(u(p)) sequence.

Input

Input contains (in given order): M, N, A(1), A(2), ..., A(M), u(1), u(2), ..., u(N). All numbers are divided by spaces and (or) carriage return characters.

Output

Write to the output Black Box answers sequence for a given sequence of transactions, one number each line.

Sample Input

7 4
3 1 -4 2 8 -1000 2
1 2 6 6

Sample Output

3
3
1
2

Source

题意：输入n和m，然后有两行输入，第一行有n个数输入，第二行有m个数的输入，每个数的意思是已经输入了几个数，他所在的位置表示从小到大的排序第几个数

题解：两个优先队列，一个从小到大，一个从大到小。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;

int main()
{
    int n, m, i, j, x, y, z;
    int a[31000], b[31000], k;
    while(~scanf("%d%d", &n, &m))
    {
        priority_queue<int, vector<int>, greater<int> >q1;
        priority_queue<int, vector<int>, less<int> >q2;
        for(i = 1; i <= n; i++)
        {
            scanf("%d", &a[i]);
        }
        for(i = 1; i <= m; i++)
        {
            scanf("%d", &b[i]);
        }
        i = 0;//记录a[i]的输入
        j = 1;//记录b[j]的输入
        k = 1;//记录b[j]的位置
        while(j <= m)
        {
            if(i == b[j])
            {
                if(q2.size() < k)
                {
                    int t = q1.top();
                    q2.push(t);
                    q1.pop();
                }
                k++;
                j++;
                printf("%d\n", q2.top());
            }
            else
            {
                i++;
                if(q2.size() < k)//q2不满，先放q1中，排好后把最小的拿到q2中。
                {
                    q1.push(a[i]);
                    int w = q1.top();
                    q2.push(w);
                    q1.pop();
                }
                else if(q2.top() > a[i])//q2满了，和q2中的第一个数比较大小，把小的发在q2中。
                {
                    int e = q2.top();
                    q2.pop();
                    q1.push(e);
                    q2.push(a[i]);
                }
                else//否则直接放到q1中。
                {
                    q1.push(a[i]);
                }
            }
        }
    }
    return 0;
}