编辑代码

#include <iostream>
using namespace std;

int n;
long long sum;
int s[1145];  //前缀和

struct node
{
    int time;   //接水时间
    int no;  //原编号
}t[1145];

bool cmp(node x,node y)
{
    return x.time < y.time;
}

int main() {
    cin>>n;
    for(int i = 1;i <= n;i++)
    {
        cin>>t[i].time;
        t[i].no = i;
    }
    sort(t + 1,t + 1 + n,cmp);

    for(int i = 1;i <= n;i++)
    {
        cout<<t[i].no<<" ";
        s[i+1] = s[i] + t[i].time;
    }
    cout<<endl;

    for(int i = 1;i <= n;i++)
    {
        sum += s[i];
    }

    printf("%.2lf\n",sum / n);

	return 0;
}