#include <stdio.h>
#include <algorithm>
#define N 100010
int a[N];
using namespace std;
int main(){
int n;
scanf("%d", &n);
for(int i=0; i<n; ++i){
scanf("%d", &a[i]);
}
sort(a, a+n);
int max = a[n-1];
int min = a[0];
if(n%2==1){
int mid = a[n/2];
printf("%d %d %d", max, mid, min);
}else{
if((a[n/2-1]+a[n/2])%2 == 0){
int mid = (a[n/2-1]+a[n/2])/2;
printf("%d %d %d", max, mid, min);
}else{
double mid = (a[n/2-1]+a[n/2])/2;
if(mid > 0){
mid += 0.5;
}else{
mid -= 0.5;
}
printf("%d %.1f %d", max, mid, min);
}
}
}
ccf201903-1小中大(满分代码)
最新推荐文章于 2022-10-21 07:27:25 发布