CCF：小中大

#include <iostream>
using namespace std;
#include <algorithm>
#include<iomanip>
int main(void)
{
	int n, i;
	cin >> n;
	int a[n];
	int max, min;
	int flag = 1;
	float mid;
	for(i = 0; i < n; i ++)
	{
		cin >> a[i];
	}
	sort(a, a+n);
	min = a[0];
	max = a[n-1];
	if(n % 2 == 1)
	{
		mid = a[(n+1)/2-1];
		flag = 0;
	}
	else
	{
		mid = (a[n/2] + a[n/2-1]) / 2.0;
		if(mid - (int)mid == 0)
			flag = 0;
	}
	cout << max << " " << fixed << setprecision(flag) << mid << " " << min << endl;  //四舍五入处理 
	return 0;
}