POJ 2371 Questions and answers

 1 #include<stdio.h>
 2     int n,a[999999],b[999999];
 3 void kuaipai(int left,int right)
 4 {
 5     int i,j,t,temp;
 6     if(left>right)
 7         return;
 8     temp=a[left];
 9     i=left;
10     j=right;
11     while(i!=j)
12     {
13         while(a[j]>=temp && i<j)
14             j--;
15         while(a[i]<=temp && i<j)
16             i++;
17         if(i<j)
18         {
19             t=a[i];
20             a[i]=a[j];
21             a[j]=t;
22         }
23     }
24     a[left]=a[i];
25     a[i]=temp;
26     kuaipai(left,i-1);
27     kuaipai(i+1,right);
28 }
29 int main()
30 {
31     while(scanf("%d",&n)!=EOF)
32     {
33         int i,j;
34         for(i=1;i<=n;i++)
35         {
36             scanf("%d",&a[i]);
37         }
38         kuaipai(1,n);
39         char s[100];
40         scanf("%s",s);
41         scanf("%d",&n);
42         for(i=1;i<=n;i++)
43             scanf("%d",&b[i]);
44         for(i=1;i<=n;i++)
45             printf("%d\n",a[b[i]]);
46         
47         
48     }
49     return 0;
50 }