#include<bits/stdc++.h>
using namespace std;
const int N=310;
double a[N];
int main()
{
	int n;
	cin>>n;
	int maxid,minid;
	double sum=0;
	for (int i=1;i<=n;i++)
	{
		cin>>a[i];
		if (i==1 || a[i]>a[maxid])
		{
			maxid=i;
		}
		if (i==1 || a[i]<a[minid])
		{
			minid=i;
		}
		sum+=a[i];
	}
	sum=sum-a[maxid]-a[minid]; //减去最大值和最小值
	double ave=sum/(n-2); //平均数
	double res=0;
	for (int i=1;i<=n;i++)
    
	{
		if (i==maxid || i==minid) continue; 
		double t=abs(a[i]-ave);
		if (t>res)
		{
			res=t;
		}
	}
	cout<<fixed<<setprecision(2)<<ave<<" "<<res; 
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
double a[1111];
int main()
{
	int n;
	cin>>n;
	double c=0;
	double d=0;
	double cc=99999;
	double dd=0;
	double m=0;
	double g=0;
	double k=0;
	double s=0;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		if(a[i]>c)
		{
			k=c;
			c=a[i];
		}
		else if(k<a[i])
		{
			k=a[i];
		}
		if(a[i]<cc)
		{
			dd=cc;
			cc=a[i];
		}
		else if(a[i]<dd)
		{
			dd=a[i];
		}
		m+=a[i];
		g=i;
	}
	//c是最大值,k是次大值,cc是最小值,dd是次小值 
	m=m-cc-c;
	g-=2;
	m=m/g;
	dd=max(m-dd,k-m);
	cout<<fixed<<setprecision(2)<<m<<" "<<dd;
	return 0;
}

| | | | | | col | | - | | content | | | - | | content | | col | col | col | col | col | | - | - | - | - | - | - | | content | content | content | content | content | content | | content | content | content | content | content | content | | content | content | content | content | content | content | | content | content | content | content | content | content | | col | col | col | | - | - | - | - | | content | content | content | content | | col | col | col | | - | - | - | - | | content | content | content | content | | col | col | | - | - | - | | content | content | content |#include<bits/stdc++.h> using namespace std; int n; double arr[333]; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>arr[i]; } sort(arr+1,arr+n+1); double cnt=0; for(int i=2;i<=n-1;i++){ cnt+=arr[i]; } cnt=cnt/(n-2); double maxn=0; for(int i=2;i<=n-1;i++){ double now=abs(arr[i]-cnt); if(now>maxn){ maxn=now; } } cout<<fixed<<setprecision(2)<<cnt<<' '<<fixed<<setprecision(2)<<maxn; return 0; }

#include <bits/stdc++.h>
using namespace std;
double a[305];
int main()
{
	
	double n,d,x,p=0,j;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	d=a[1];
	x=a[1]; 
	for(int i=1;i<=n;i++)
	{
		if(d<a[i])d=a[i];
		if(x>a[i])x=a[i];
	} 
	for(int i=1;i<=n;i++)
	{
		if(d==a[i])
		{
			a[i]=-1;
			break;
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(x==a[i])
		{
			a[i]=-1;
			break;
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(a[i]!=-1)p=p+a[i];
	}
	j=0;
	for(int i=1;i<=n;i++)
	{
		if(j<abs(p/(n-2.0)-a[i]) && a[i]!=-1)
		{
			j=abs(p/(n-2.0)-a[i]);
		}
	}
printf("%.2lf %.2lf",p/(n-2.0),j);	
 }

#include<bits/stdc++.h>
using namespace std;
double a[1145];
int main()
{
	int n;
	cin>>n;
	double s=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		s+=a[i];
	}
	sort(a+1,a+n+1);
	s-=a[1]+a[n];
	s/=(n-2);
	double e=max(s-a[2],a[n-1]-s);
	cout<<fixed<<setprecision(2)<<s<<" "<<e;
	return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<double> samples(n);
    for (int i = 0; i < n; ++i) {
        cin >> samples[i];
    }
    sort(samples.begin(), samples.end());  // 对样本进行排序
    double sum = 0.0;
    for (int i = 1; i < n - 1; ++i) {
        sum += samples[i];
    }
    double average = sum / (n - 2);  // 平均白细胞数量
    double maxDiff = 0.0;
    for (int i = 1; i < n - 1; ++i) {
        maxDiff = max(maxDiff, abs(samples[i] - average));
    }
    cout << fixed << setprecision(2) << average << " " << maxDiff << endl;
    return 0;
}

这个是对的，可以试一试，不对的话给差评，如果是对的，麻烦给个好评，谢谢！

#include<bits/stdc++.h>
using namespace std;
const int N=310;
double a[N];
int main()
{
	int n;
	cin>>n;
	int maxid,minid;
	double sum=0;
	for (int i=1;i<=n;i++)
	{
		cin>>a[i];
		if (i==1 || a[i]>a[maxid])
		{
			maxid=i;
		}
		if (i==1 || a[i]<a[minid])
		{
			minid=i;
		}
		sum+=a[i];
	}
	sum=sum-a[maxid]-a[minid];
	double ave=sum/(n-2);
	double res=0;
	for (int i=1;i<=n;i++)//
	{
		if (i==maxid || i==minid) continue; 
		double t=abs(a[i]-ave);
		if (t>res)
		{
			res=t;
		}
	}
	cout<<fixed<<setprecision(2)<<ave<<" "<<res; 
	return 0;
}

nisnfneakjjgima