#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <iomanip>
using namespace std;
int main()
{
int n;
cin >> n;
int a[100000];
for(int i = 0;i < n;i++){
cin >> a[i];
}
int mina = a[0],maxa = a[n-1];
if(a[0] > a[n-1])
mina = a[n-1],maxa = a[0];
double mid;
if(n%2 == 0){
mid = (double)(a[n/2]+a[n/2-1])/2;
if((a[n/2]+a[n/2-1])%2 == 1){
printf("%d %.1lf %d",maxa,mid,mina);
}else{
printf("%d %d %d",maxa,(int)mid,mina);
}
}else{
cout << maxa << " " << a[n/2] << " " << mina;
}
cout << endl;
return 0;
}
CCF201903-1 小中大 满分
最新推荐文章于 2020-04-05 22:39:57 发布