tle+wa

#include<bits/stdc++.h>
using namespace std;
struct person{
    int t;
    int id;
};

int main()
{
    int n;
    if(!(cin>>n)) return 0;
    vector<person> a(n);
    for(int i=0;i<n;i++)
    {
        cin>>a[i].t;
        a[i].id=i+1;
    }
    sort(a.begin(),a.end(),[](const person& x, const person& y){return x.t !=y.t?y.t:x.id<y.id;});
    long long total_wait=0;
    long long prefix=0;
    for(int i=0;i<n;i++)
    {
        total_wait+=prefix;
        prefix+=a[i].t;
    }
    
    for(int i=0;i<n;i++)
    {
        cout<<a[i].id<<(i+1==n ? '\n' : ' ');
    }
    
    cout<<fixed<<setprecision(2)<<double(total_wait)/n<<'\n';
    return 0;
}