天天看點

Who‘s in the Middle

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<sstream>
#include<vector>
#include<ctime>
#include<list>
#define int long long
const int inf=0x3f3f3f3f;
int a[100005];
using namespace std;
signed main()
{
  int n;
  cin>>n;
  for(int i=1;i<=n;i++)
  {
    scanf("%lld",&a[i]);
  }
  sort(a+1,a+n+1);
  cout<<a[n/2+1]<<endl;
  return 0;
}      

繼續閱讀