代码如下:
#include <iostream>
#include<algorithm>
using namespace std;
bool com(int a,int b)
{
return a < b;
}
int main()
{
long num = 0;
cin >> num;
int * arr = new int[num];
for(int i = 0;i < num;i++)
{
cin >> arr[i];
}
sort(arr,arr+num,com);
if((num)%2)
{
cout << arr[num/2] << endl;
}
else
{
int mid = (num)/2;
cout << (arr[mid-1]+arr[mid])/2;
}
return 0;
}