[CCF-CSP]2019-03-1-小中大

[CCF-CSP]2019-03-1-小中大

#include <cstdio>
#include <iostream>

using namespace std;

int main()
{
	int n;
	cin >> n;
	int N[n] = {0};
	for(int i = 0;i < n;i++){
		cin >> N[i];
	}
	int max = 0,min = 0;
	double mid = 0.0;
	if(N[0] <= N[n-1]){
		min = N[0];
		max = N[n-1];
	}
	if(N[0] > N[n-1]){
		max = N[0];
		min = N[n-1];
	}
	if(n % 2 == 0){
		mid = (N[n/2] + N[n/2-1])/2.0 ;
	}
	if(n % 2 == 1){
		mid = N[(n-1)/2];
	}
	if(mid >= max) cout << mid <<" "<< max << " " << min << endl;
	if(mid < max) cout << max << " " << mid << " " << min <<endl;

	return 0; 
 }