POJ2371Questions and answers

Time Limit: 1000MS
Memory Limit: 65536KTotal Submissions: 10241
Accepted: 5447

Description

The database of the Pentagon contains a top-secret information. We don't know what the information is — you know, it's top-secret, — but we know the format of its representation. It is extremely simple. We don't know why, but all the data is coded by the natural numbers from 1 up to 5000. The size of the main base (we'll denote it be N) is rather big — it may contain up to 100 000 those numbers. The database is to process quickly every query. The most often query is: "Which element is i-th by its value?"— with i being a natural number in a range from 1 to N. 

Your program is to play a role of a controller of the database. In the other words, it should be able to process quickly queries like this.

Input

The standard input of the problem consists of two parts. At first, a database is written, and then there's a sequence of queries. The format of database is very simple: in the first line there's a number N, in the next N lines there are numbers of the database one in each line in an arbitrary order. A sequence of queries is written simply as well: in the first line of the sequence a number of queries K (1 <= K <= 100) is written, and in the next K lines there are queries one in each line. The query "Which element is i-th by its value?" is coded by the number i. A database is separated from a sequence of queries by the string of three symbols "#".

Output

The output should consist of K lines. In each line there should be an answer to the corresponding query. The answer to the query "i" is an element from the database, which is i-th by its value (in the order from the least up to the greatest element).

Sample Input

571211237121###43325

Sample Output

1211217123

Source

Ural State University Internal Contest October'2000 Junior Session

代码：
/*
 *poj NO.2371
 */
#include <iostream>
#include <cstdio>
#include <stdlib.h>
using namespace std;
int cmp(const void* a,const void* b)
{
return (*(short*)a-*(short*)b);
}
int main()
{
short data[100000];
int n,k;
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&data[i]);
qsort(data,n,sizeof(short),cmp);
scanf("### %d",&k);
for(j=0;j<k;++j)
{
scanf("%d",&i);
printf("%d\n",data[i-1]);
}
return 0;


}