POJ之路13-POJ2388

//79ms

#include<string>
#include<fstream>
#include<algorithm>
using namespace std;

int main()
{
//	ifstream cin("data.txt");
int n,i;
int a[10001];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
cout<<a[n/2]<<endl;
return 0;
}

#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;

int cmp(void const*a,void const*b)
{
return *(int*)a-*(int*)b;
}

int main()
{
//	ifstream cin("data.txt");
int n,i;
int a[10001];
while(cin>>n)
{
for(i=0;i<n;i++)
{
cin>>a[i];
}
qsort(a,n,sizeof(a[0]),cmp);
cout<<a[n/2]<<endl;
}

return 0;
}