//524K 63MS C++
#include <cstdio>
#include <cstring>
#include <cstdlib>
int cmp(const void * a, const void * b) {
return *((int*)a) - *((int*)b);
}
using namespace std;
const int MAX = 100001;
int array[MAX];
int dataBaseSize;
int queryNum;
int main() {
while(scanf("%d", &dataBaseSize) != EOF) {
memset(array, 0, sizeof(array));
for (int i = 0; i < dataBaseSize; i++) {
scanf("%d", &array[i]);
}
qsort(array, dataBaseSize, sizeof(int), cmp);
char tmp[10];
scanf("%s", tmp);
scanf("%d", &queryNum);
for (int i = 0; i < queryNum; i++) {
int ordinal;
scanf("%d", &ordinal);
printf("%d\n", array[ordinal-1]);
}
}
}
水题,不过此题以后可以作为测试自己写的排序算法是否正确的工具,
mark一下