#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int v[100000];
int n,x;
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
v[i]=x;
}
int max;
int min;
if(v[0]>v[n-1]){
max=v[0];
min=v[n-1];
}
else{
max=v[n-1];
min=v[0];
}
cout<<max<<" ";
if(n%2==1){
cout<<v[n/2]<<" ";
}
else{
if((v[n/2]+v[n/2-1])%2==1){
double p=(double)((v[n/2]+v[n/2-1])/2.0);
printf("%.1lf ",p);
}
else{
cout<<(v[n/2]+v[n/2-1])/2<<" ";
}
}
cout<<min;
return 0;
}
CCF-CSP 201903-1 小中大
最新推荐文章于 2024-08-12 18:10:44 发布