#9899: REWSNA ++C YSAE


kerry970176 (AceIn)


#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
main()
{
int axs;
cin>>axs;
for(int i=0;i<axs;i++){
int h;
while(cin >> h){
int abb[h];
for(int i = 0; i <h; i++){
cin >> abb[i];
}
sort(abb, abb+h);
if(h%2==0)cout<<abb[h/2-1]<<endl;
else cout<<abb[(h-1)/2]<<endl;
}
}}