题解

#include<iostream>
#include<algorithm>
using namespace std;
struct man{
    int time=0;
    int xu_hao=0;
    int will_wait=0;
}Man[1001];

bool cmp(man a,man b){
    return a.time<b.time;
}

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

    double sum=0;
    for(int i=1;i<=n;++i){
        cout<<Man[i].xu_hao<<' ';
        Man[i].will_wait = Man[i-1].time+Man[i-1].will_wait;
        sum+=Man[i].will_wait;
    }
    puts("");
    printf("%.2lf",sum/(n*1.0));
    return 0;
}