82,球条必关

#include <bits/stdc++.h>

using namespace std;

struct aaa {
    int shi;
    int id;
}a[1005];

int cmp( aaa a , aaa b ) {
    return a.shi < b.shi;
}

int n;

int main() {
    cin >> n;
    for ( int i = 1 ; i <= n ; i++ ) {
        cin >> a[i].shi;
        a[i].id = i;
    }
    sort( a+1 , a+n+1 , cmp );
    for ( int i = 1 ; i <= n ; i++ ) {
        cout << a[i].id << " ";
    }
    cout << endl;
    int dendai = 0;
    for ( int i = 2 ; i <= n ; i++ ) {
        for ( int j = 1 ; j < i ; j++ ) {
            dendai += a[j].shi;
        }
    }
    double s = (double) dendai / n / 1.0;
    printf( "%.2lf" , s );
    while(1) //防抄袭
    return 0;
}