POJ 2388 Who's in the Middle

排序后输出中位数，直接用algorithm的sort。

 

/*Accepted    204K    32MS    C++    347B    2012-08-02 17:13:37*/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int MAXN = 10010;
int a[MAXN], n;

int main()
{
    int i;
    while(scanf("%d", &n) == 1)
    {
        for(i = 0; i < n; i ++)
            scanf("%d", &a[i]);
        sort(a, a + n);
        printf("%d\n", a[n >> 1]);
    }
    return 0;
}