1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 |
#include <iostream> #include <algorithm> #include <queue> #include <vector> #include <cstdlib> #include <cstdio> #include <string> #include <cstring> #include <ctime> #include <iomanip> #include <cmath> #include <set> #include <map> #include <stack> using namespace std; int main(){ int n = 0; while (cin >> n) { vector<int> cows; while (n--) { int k = 0; cin >> k; cows.push_back(k); } sort(cows.begin(),cows.end()); cout << cows[(cows.size()-1)/2] << endl; } return 0; } |
我先给水过去,然后加难度。。。