问题类型：一次性AC
03pie’s solution for [HDU-1029]: 问题链接
#include <iostream>
#include <algorithm>
using namespace std;
const int N=
999999;
int data[N];
int main()
{
int n;
while(
cin >> n) {
for(
int i=
0; i<n; i++)
cin >> data[i];
sort(data, data + n);
printf(
"%d\n", data[(n +
1) /
2]);
}
return 0;
}
转载请注明原文地址: https://ju.6miu.com/read-667110.html
