[Home|Training|Problems|Contests|C Language] | [Login|Register] |

Problems Status Rank |
Problem 1030
Black Box
Time Limit: 1000ms
Memory Limit: 65536kb 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:x): put element x into Black Box;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.Example 1:
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 1 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 1 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
nput 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.
There maybe several cases.
Output
Write to the output Black Box answers sequence for a given sequence of transactions. The
numbers must be separated with end-of-line characters.You must seperate all the sequences
by a single empty line.
Sample Input
7 4 3 1 -4 2 8 -1000 2 1 2 6 6 Sample Output
3 3 1 2 |

University of Science and Technology of China

Online Judge for ACM/ICPC

Processed in 2.3ms with 1 query(s).

Online Judge for ACM/ICPC

Processed in 2.3ms with 1 query(s).