Black Box
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 11225 | Accepted: 4578 |
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
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.
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
题目大意
先给你两个整数A,U;
A代表数据个数,U代表访问次数;
然后下一行为A个数,无需;
在下一行为求最小数的数据范围;
然后第一次访问求范围内第一小的数,第二次访问求的是范围内第二小的数以此类推;
示例 分析
第一个数是1也就是插入一个数(3)时,第i(1)小的数是3.
第二个数是2也就是插入两个数(3,1)时第i(2)小的数是3.
第三个数是6也就是插入六个数(3,1,-4,2,8,-1000)第i(3)小的数是1.
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
const int MAX = 30000+10;
int a[MAX],u[MAX];
int main()
{
int A,U,i;
while(~scanf("%d %d",&A,&U))
{
priority_queue<int,vector<int>,greater<int> >Maxmin;
priority_queue<int>Minmax;
for(i = 0; i < A; i++)
scanf("%d",&a[i]);
for(i = 0; i < U; i++)
scanf("%d",&u[i]);
int id = 0;
for(int j = 0; j < U; j++)
{
if(id == 0)
{
for(i = id; i < u[j]; i++)
{
Maxmin.push(a[i]);
}
int x = Maxmin.top();
Maxmin.pop();
Minmax.push(x);
printf("%d\n",x);
id = u[j];
}
else
{
for(i = id; i < u[j]; i++)
{
int x = Minmax.top();
if(x > a[i])
{
Minmax.pop();
Maxmin.push(x);
Minmax.push(a[i]);
}
else
Maxmin.push(a[i]);
}
printf("%d\n",Maxmin.top());
int y = Maxmin.top();
Maxmin.pop();
Minmax.push(y);
id = u[j];
}
}
}
return 0;
}