思路:上周作业原题,自己翻
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define endl '\n'
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;
ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
vector<int> v;
int main()
{
IOS;
int n;
cin >> n;
repn(i, 1, 2 * n)
{
int x;
cin >> x;
v.pb(x);
}
sort(v.begin(), v.end());
cout << v[(n - 1 + n) / 2] << endl;
return 0;
}