数据比较小,用快排或堆结构都行。
mysol:
STL 堆 reference:http://www.cplusplus.com/reference/algorithm/make_heap/?kw=make_heap
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
bool comp(const int & a, const int & b)
{
return a >= b;
}
int main()
{
int n, i;
int tmp;
cin >> n;
vector<int> v;
for (i=0;i<n;++i)
{
cin >> tmp;
v.push_back(tmp);
}
make_heap(v.begin(), v.end(), comp);
for(i=0;i<n / 2;++i)
{
pop_heap(v.begin(), v.end(), comp);
v.pop_back();
}
cout << v.front() << endl;
return 0;
}