poj 1442 -- Black Box

Black Box

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 7183		Accepted: 2920

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

题意：用测试数据解释。给出7个数，4次操作。第一次操作是1,说明前一个数中第一小的数是多少，第二次操作是2,说明前2个数中第2小的是多少，
第三次操作是6,说明前6个数中第3小的是多少。第四次操作是6,说明前6个中第4小的是多少。

思路：用到两个堆，一个最大堆，一个最小堆。其中最大堆用来维护，最小堆用来求k小数。 

/*======================================================================
 *           Author :   kevin
 *         Filename :   BlackBox.cpp
 *       Creat time :   2014-07-28 15:46
 *      Description :
 ========================================================================*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#define clr(a,b) memset(a,b,sizeof(a))
#define M 30005
using namespace std;
int s[M];
struct cmp
{
    bool operator() (const int& x,const int& y){
        return x > y;
    }
};
int main(int argc,char *argv[])
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        priority_queue<int>max;
        priority_queue<int,vector<int>,cmp>min;
        for(int i = 0; i < n; i++){
            scanf("%d",&s[i]);
        }
        int a,t = 0,minheap,maxheap;
        for(int i = 0; i < m; i++){
            scanf("%d",&a);
            for(int i = t; i < a; i++){
                min.push(s[i]);
                if(!max.empty()){
                    minheap = min.top();
                    maxheap = max.top();
                    if(minheap < maxheap){
                        min.pop(); max.pop();
                        min.push(maxheap);
                        max.push(minheap);
                    }
                }
            }
            t = a;
            printf("%d\n",min.top());
            max.push(min.top());
            min.pop();
        }
    }
    return 0;
}