L2-021. 点赞狂魔

最新推荐文章于 2022-08-08 19:05:34 发布

Whowell

最新推荐文章于 2022-08-08 19:05:34 发布

阅读量204

点赞数 1

分类专栏：其他---------STL pat

本文链接：https://blog.csdn.net/weixin_39792252/article/details/79659105

版权

其他---------STL 同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

pat

18 篇文章 0 订阅

订阅专栏

L2-021. 点赞狂魔

赞赞赞！！！！！！

#include<bits/stdc++.h>

using namespace std;

struct mp{
    string s;
    int k;
    double g;
} m[1000];

bool cmp(struct mp a, struct mp b) {
    if(a.k != b.k)
    return a.k > b.k;
    else return a.g < b.g;
}

set<int> se;
int main()
{
    string s;
    int n;
    scanf("%d",&n);
    for(int i = 0; i < n; i++){
        getchar();
        cin >> s;
        int k;
        long long sum = 0;
        scanf("%d",&k);
        for(int j = 0; j < k; j++) {
            int c;
            scanf("%d",&c);
            se.insert(c);
        }
        m[i].s = s;
        m[i].k = se.size();
        m[i].g = k*1.0/m[i].k;
        se.clear();
    }
    sort(m, m+n, cmp);
    if(n >= 3) cout << m[0].s << " " << m[1].s << " " << m[2].s << endl;
    else if(n >= 2) cout << m[0].s << " " << m[1].s << " -" << endl;
    else if(n >= 1) cout << m[0].s << " -" << " -" << endl;
    else cout << "- - -" << endl;
    return 0;
}