排队接水求调

#include<bits/stdc++.h>
using namespace std;

struct Man{
    int id;
    int time;
};
vector<Man> man;
bool cmp(const Man& a, const Man& b){
    return a.time < b.time;  
}

int main(){
    int n;

    cin >> n;

    man.resize(n);
    vector<int> timeNeeds(n,0);

    for (int i = 1;i <= n;i++){
        man[i].id = i;
        cin >> man[i].time;
    }    

    sort(man.begin(), man.end(),cmp);

    for (int i = 1; i <= n; i++)
        cout << man[i].id << " ";
    cout << endl;
    double s = 0;
    for (int i = 1;i <= n;i++){
        s += man[i].time * (n - i);
    }
    printf("%.2f",s / n);
    return 0;
}