The 5th Zhejiang Provincial Collegiate Programming Contest---ProblemF：Faster, Higher, Stronger

#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int t,i;
string s;
int n,a[10001];
cin>>t;
while(t--) {
cin>>s>>n;
for(i=0; i<n; i++)
cin>>a[i];
sort(a,a+n);
if(s[0]=='F')
cout<<a[0]<<endl;
else
cout<<a[n-1]<<endl;
}
return 0;
}