ccf-2019/3/17--第一题

100分代码：

/* 1 */
#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 10000000;
int s[N+5];

int main(void)
{
	int n;
	double mid;
	scanf("%d",&n);
	for(int i=0; i<n; i++){
		scanf("%d",&s[i]);
	}
	
	sort(s,s+n);//pai xu
	
	if(n % 2 == 0){//ou shu
		mid = (double)(s[n / 2] + s[n/2 - 1]) / 2.0;
		if((s[n/2] + s[n/2 - 1]) % 2 == 1){//fen shu
			printf("%d %.1lf %d",s[n-1],mid,s[0]);
		}else
			printf("%d %.0lf %d",s[n-1],mid,s[0]);
	}else if(n % 2 == 1){//ji shu
		mid = s[n / 2];
		printf("%d %.0lf %d",s[n-1],mid,s[0]);
	}
	return 0;
}