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:
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).
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
给定M个数,每次可以插入序列一个数;再给N个数,表示在插入第几个数时输出一个数,第一次输出序列中最小的,第二次输出序列中第二小的……以此类推,直到输出N个数。
其实就是输出递增序列的第1,2…k个数,但这个序列是不确定的。
把这个递增序列看作两个部分,中间以第k个数作为分界,这个第k个数就是第k小的数。
左边的部分就用最大堆(可以看作是反向)保存,右边的用最小堆保存,这两个堆共同维护了一个递增序列,容易看出最大堆的最大数一定要小于最小堆的最小数。每插入一个数,保存在右边的堆,再通过刚才的性质维护一下,然后输出右边的最小数就是第k小的数,输出完后k要+1,所以把要右边的数往左边挪一下。
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MAXN 30005
#define Mod 10001
using namespace std;
int add[MAXN];
int main()
{
priority_queue<int,vector<int>,less<int> > left;
priority_queue<int,vector<int>,greater<int> > right;
int m,n;
while(~scanf("%d%d",&m,&n))
{
for(int i=1;i<=m;++i)
scanf("%d",&add[i]);
int get,k=1;
for(int i=0;i<n;++i)
{
scanf("%d",&get);
while(k<=get)
{
right.push(add[k]);
if(!left.empty()&&left.top()>right.top())
{
int t=left.top();
left.pop();
right.push(t);
t=right.top();
right.pop();
left.push(t);
}
k++;
}
printf("%d\n",right.top());
int t=right.top();
right.pop();
left.push(t);
}
}
return 0;
}