#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
while(cin >> n)
{
int *a = new int[n+1];
for(int i = 0; i < n; i++)
cin >> a[i];
sort(a, a+n);
cout << a[n/2] << endl;
delete [] a;
}
return 0;
}
HDU 1157 中位数有更高效的方法,编程之美又提到,以后实践
最新推荐文章于 2023-01-30 11:48:12 发布