【贪心】排队接水——洛谷1223

华年的小年华

已于 2023-02-09 16:16:20 修改

阅读量105

点赞数

分类专栏：贪心文章标签：算法 c++ Powered by 金山文档

于 2023-02-09 16:00:11 首次发布

本文链接：https://blog.csdn.net/Yapink/article/details/128954683

版权

贪心专栏收录该内容

4 篇文章 0 订阅

订阅专栏

pair

#include <iostream>
#include <algorithm>

typedef long long LL;

using namespace std;

typedef pair<int, int> PII;

const int N = 1010;

int n;
PII a[N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ ) cin >> a[i].first, a[i].second = i;
    
    LL sum = 0;
    sort(a + 1, a + n + 1);
    
    for (int i = 1; i < n; i ++ ) sum += (LL)a[i].first * (n - i);

    for (int i = 1; i <= n; i ++ ) cout << a[i].second << ' ';
    printf("\n%.2lf\n", sum / (n * 1.0));
    return 0;    
}

#include <iostream>
#include <algorithm>

typedef long long LL;

using namespace std;

const int N = 1010;

struct Rec
{
    int t, b;
}a[N];

int n;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ ) cin >> a[i].t, a[i].b = i;
    
    LL sum = 0;
    sort(a + 1, a + n + 1, [&](Rec a, Rec b){
        return a.t < b.t;
    });
    
    for (int i = 1; i < n; i ++ ) sum += (LL)a[i].t * (n - i);

    for (int i = 1; i <= n; i ++ ) cout << a[i].b << ' ';
    printf("\n%.2lf\n", sum / (n * 1.0));
    return 0;    
}