POJ 2388 Who's in the Middle(水~奇数个数排序求中位数)

1 #include<stdio.h>
2 #include<algorithm>
3 using namespace std;
4 int main()
5 {
6     int n;
7     while(scanf("%d",&n)!=EOF)
8     {
9         int na[n+1];
10         for(int i=0; i<n; i++)
11             scanf("%d",&na[i]);
12         sort(na,na+n);
13         printf("%d\n",na[n/2]);
14     }
15     return 0;
16 }