1029 小技巧（n+1）/2

利用好这个至少出现（n+1)/2很重要，O（nlgn）才能ac，真是服了这题目

/* ***********************************************
Author        :PeterBishop
Created Time  :Tue 05 Mar 2019 20:26:16 CST
File Name     :test.cpp
Origin        :H D O J 1029
************************************************ */

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
const int MAXN=999999+1;
int a[MAXN];
int main()
{
    //freopen("out.txt","w",stdout);
    freopen("in.txt","r",stdin);
    int N;
    while(cin>>N){
        for(int i=1;i<=N;i++)
        {
            cin>>a[i];
        }
        sort(a,a+N);
        cout<<a[(N+1)/2]<<endl;
    }


    return 0;
}