Black Box（优先队列）

Black Box

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 11971		Accepted: 4911

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

题意：

给你一串数，有m(m<=30000)个数要成立一个序列，有n(n<=m)个询问，每次询问输入一个数，表示插入第几个数时输出第i个小的数。

以样例为例：输入第一个数  3  求起一个的数  为 3,  输入第二个数  1，求第二小的数为 3, 输入第6个数，因为6之前还有数没检测，所以要先进队，然后再输出第三小的数 1,。。。。。。。

例如S[1..n] = 1,2,3,4,5,6,7，index = 4，则大顶堆为{3,2,1}，小顶堆为{4,5,6,7}为什么要这样维护呢？因为当小堆最小的元素都大于大堆最大的元素时，那么序列中排第index个数就是小堆最小的数了。

就是让less队列存前i小的数，第i个小的数就是greater堆最小的那个

#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int a[30010];
int main()
{
    int n,m,x;
    priority_queue<int, vector<int>,greater<int> >p;
    priority_queue<int, vector<int>,less<int> >q;
    scanf("%d%d",&n,&m);
    for(int i=0;i<=n-1;i++)
    {
        scanf("%d",&a[i]);//此时还未进堆
    }
    int c=0;
    for(int i=0;i<m;i++)
    {
        scanf("%d",&x);
        while(c<x)
        {
           p.push(a[c++]);//进到x
        }
        while(!q.empty()&&p.top()<q.top())//一开始，less堆为空，greater堆最小的就是第一小的，
        {
              int t=p.top();//这些相当于两个堆得堆顶元素交换
              p.pop();
              p.push(q.top());//必须要让greater堆里的所有元素都大于less堆里，才能保证greater里最小的数是第i小的数
              q.pop();
              q.push(t);
        }
        printf("%d\n",p.top());//一开始，less堆为空，greater堆最小的就是第一小的直接输出
        q.push(p.top());//每次往less堆里存一个最小的数，那下一次greater堆里最小的就是第i小的
        p.pop();//greater里最小的转移到less里
    }
    return 0;
}