201903-1 小中大

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

int main(int argc, char const *argv[]) {
//	freopen("in.txt", "r", stdin);
	int n;
	scanf("%d", &n);
	vector<int> v;
	for (int i = 0; i < n; i++) {
		int t;
		scanf("%d", &t);
		v.push_back(t);
	}
	int _max = *max_element(v.begin(), v.end());
	int _min = *min_element(v.begin(), v.end());
	printf("%d ", _max);

	int m = 0;  // mean
	if (v.size() % 2 == 0) {
		m = v[v.size() / 2 - 1] + v[v.size() / 2];
		if (m % 2 == 0) {
			printf("%d ", m / 2);
		} else {
			printf("%.1f ", (float)m / 2);
		}
	} else {
		m = v[v.size() / 2];
		printf("%d ", m);
	}
	printf("%d\n", _min);

	return 0;
}