原题链接:CCF-CSP 201903-1 小中大
#include <bits/stdc++.h>
using namespace std;
const int N=2010;
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,a;
cin>>n;
vector<int> v;
for(int i=0;i<n;i++)
{
cin>>a;
v.push_back(a);
}
sort(v.begin(),v.end());
cout<<v[n-1]<<" ";
int mid;
n/=2;
if(n&1) mid=v[n]*2;
else mid=v[n]+v[n-1];
if(mid>v[0]*2)
{
if(mid&1)
{
double mid2=mid/2.0;
cout<<setiosflags(ios::fixed)<<setprecision(1)<<mid2<<" ";
}
else cout<<mid/2<<" ";
cout<<v[0];
}
else
{
cout<<v[0]<<" ";
if(mid&1)
{
double mid2=mid/2.0;
cout<<setiosflags(ios::fixed)<<setprecision(1)<<mid2;
}
else cout<<mid/2;
}
return 0;
}