http://www.bnuoj.com/bnuoj/problem_show.php?pid=2490
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; bool cmp(int a, int b) { return a<b; } int a[100010]; int main() { int n,i,k; char b[3]; while(scanf("%d",&n)!=EOF) { for(i = 0; i < n; i++) { scanf("%d",&a[i]); } sort(a,a+n,cmp); scanf("%s",&b); scanf("%d",&k); while(k--) { scanf("%d",&n); printf("%d\n",a[n-1]); } } return 0; }