直接快排
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define maxn 10050
using namespace std;
int a[maxn];
struct Node{
int x;
int y;
bool operator <(const Node &other) const{
return x<other.x;
}
}node[maxn];
string s;
int main(){
int n,m=0,index;
int sum=0;
int t;
while(cin>>t){
for(int i=0;i<t;i++){
cin>>a[i];
}
sort(a,a+t);
cout<<a[t/2]<<endl;
}
return 0;
}