CodeForces 710B Optimal Point on a Line 找中位数

//http://codeforces.com/problemset/problem/710/B

//规律.找中位数即可.

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;
const int MAX=300005;
int main()
{
    cin.sync_with_stdio(false);
    int N,A[MAX]={0};
    cin>>N;
    for (int i=1;i<=N;i++)
        cin>>A[i];
    sort(A+1,A+N+1);
    if (N%2==1)
        cout<<A[N/2+1];
    else
        cout<<A[N/2];
    return 0;
}