csp-19-3-17-1-大中小

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int main(){
vector<int> vi;
int n,x;
double y;
bool flag=0;
scanf("%d",&n);	
int temp,temp1;
for(int i=1;i<=n;i++){
	scanf("%d",&temp);
	vi.push_back(temp);
}
int len=vi.size();
//printf("len:%d\n",len);
sort(vi.begin(),vi.end(),cmp);
x=(vi[len/2]+vi[len/2-1]);
if(n%2==0){
		if(x%2==0){
		flag=1;
		x=x/2;}
	else{
		flag=0;
	//	printf("X:%d\n",x);
		y=x/2;
	//	printf("Y:%f\n",y+0.5);
	}
}
else{
	flag=1;
	x=vi[(len-1)/2];
}
if(flag) printf("%d %d %d",vi[0],x,vi[len-1]);
else  printf("%d %0.1f %d",vi[0],y+0.5,vi[len-1]);
return 0;	
}