Who's in the Middle poj 2388

很简单，排个序就行了

#include <stdio.h>#include <string.h>#include <algorithm>#include<iostream>using namespace std;int a[10050];bool cmp(int a,int b){    return a<b;}int main(){    int n;    cin>>n;    for(int i=0; i<n; ++i)        cin>>a[i];    sort(a,a+n,cmp);    cout<<a[n/2]<<endl;}