#include #include #include using namespace std; const int N = 1010; int n; pair<int, int> people[N]; bool cmp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; } int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> people[i].first; people[i].second = i + 1; } sort(people, people + n, cmp); for (int i = 0; i < n; i++) { cout << people[i].second << " "; } cout << endl; double totalWaitTime = 0; for (int i = 0; i < n; i++) { totalWaitTime += people[i].first * (n - i - 1); } double averageWaitTime = totalWaitTime / n; cout << fixed << setprecision(2) << averageWaitTime << endl; return 0; }