本蒟蒻代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
int n;
struct Water
{
int num,time;
}p[1005];
bool check_cmp(Water a,Water b)
{
if(a.time^b.time)
{
return a.time<b.time;
}
return a.num<b.num;
}
namespace lzx
{
int sum=0;
}
int main()
{
std::cin>>n;
for(int i=1;i<=n;i++)
{
std::cin>>p[i].time;
p[i].num=i;
}
std::sort(p+1,p+n+1,check_cmp);
for(int i=1;i<=n;i++)
{
std::cout<<p[i].num<<' ';
lzx::sum+=i*p[n-i].time;
}
printf("\n%0.2lf\n",lzx::sum*1.0/n);
return 0;
}
记录详情传送门