P1223. 排队接水

发表于 2023-10-12 分类于洛谷阅读次数： Waline：本文字数： 174 阅读时长 ≈ 1 分钟

考点

贪心

题解

#include <bits/stdc++.h>

using namespace std;

const int LEN = 1050;

struct Node
{
    int t_, id_;
} arr[LEN];

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i)
    {
        cin >> arr[i].t_;
        arr[i].id_ = i + 1;
    }
    sort(arr, arr + n, [](Node a, Node b) -> bool
         { return a.t_ < b.t_; });
    double sum = 0;
    for (int i = 0; i < n; ++i)
    {
        cout << arr[i].id_ << " ";
        sum += arr[i].t_ * (n - i - 1);
    }
    cout << endl
         << fixed << setprecision(2) << sum / n;
    return 0;
}