太水,STL排序可以过。G++判出来是15MS, 340K.
肯定有可以优化的,懒的找了。
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int N, num;
vector<int> vec;
//freopen("in.txt", "r", stdin);
while(scanf("%d", &N)==1)
{
vec.clear();
for(int tmp = 0; tmp < N; ++tmp)
{
scanf("%d", &num);
vec.push_back(num);
}
sort(vec.begin(), vec.end());
printf("%d\n", vec.at(vec.size()/2));
}
return 0;
}