本蒟蒻太弱了，不会快读qwq
by lizerui520 @ 2022-10-16 17:32:20
@[xiaozhangma](/user/47911)
```cpp
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct no{
int xh;int time;
}a[1001];
int cmp(no x,no y)
{
return x.time <y.time ;
}
int main()
{
int n;
int i,j,s[1001]={0};
double cnt=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i].time ;
a[i].xh =i ;
}
sort(a+1,a+n+1,cmp);
for(i=1;i<=n;i++)
{
cout<<a[i].xh<<" " ;
}
cout<<endl;
s[1]=0;
for(i=2;i<=n;i++)
{
s[i]=s[i-1]+a[i-1].time;
cnt=cnt+s[i];
}
printf("%.2lf",cnt/n);
return 0;
}
```
自己找找吧qwq
by lizerui520 @ 2022-10-16 17:35:20
谢谢，可能是精度问题，把cnt类型改成double就行了，但我实在搞不懂为什么qwq
by xiaozhangma @ 2022-10-16 19:01:30
@[xiaozhangma](/user/47911) 你那个double ans=cnt; ans/=n;再乘以个1.0试试，我以前就这么错的。。。
by foryou922 @ 2022-12-25 20:21:23