#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,mid,i,sum;
bool cmp(int a,int b){return a>b;}
void strageSort(int n,int a[])
{ int k=1;
sort(a,a+n,cmp);
mid=n/2;
int b[n+1];
b[mid]=a[0];
for(i=1;i<n;i++) {
b[mid-k]=a[i];
i++;
if(i!=n) b[mid+k]=a[i];
k++;
}
for(int i=0; i<n; i++) a[i]=b[i];
sum = 0;
for(int i=0; i<n; i++) sum+= a[i];
}
int main()
{
cin>>n;
int a[n+1];
for(i=0;i<n;i++){
cin>>a[i];
}
strageSort(n,a);
double result = 0;
for( i=0; i<n; i++)
for(int j=i+1; j<n; j++)
result += (a[i]*1.0/sum)*(a[j]*1.0/sum)*(j-i);
for(i=0;i<n;i++){
sum=sum+a[i];
}
cout<< result;
}
磁盘文件最优存储
最新推荐文章于 2023-08-22 08:34:33 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)