问题 I: 排名

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

struct stu {
    char id[10];
    int sum;
};

int main() {

    int n, m, g;
    while (scanf("%d%d%d", &n, &m, &g), n) {
        int tab[m];
        for (int i = 0; i < m; ++i) {
            scanf(" %d", &tab[i]);
        }

        stu stus[n];
        memset(stus, 0, sizeof(stus));
        for (int j = 0; j < n; ++j) {
            scanf(" %s", stus[j].id);
            int t;
            scanf(" %d", &t);
            for (int i = 0; i < t; ++i) {
                int n1;
                scanf(" %d", &n1);
                stus[j].sum += tab[n1-1];
            }
        }

        sort(stus, stus + n, [](const stu &s1, const stu &s2) {
            int temp;
            temp = s1.sum - s2.sum;
            if (temp == 0) {
                int t2;
                t2 = strcmp(s1.id, s2.id);
                return t2 < 0;
            } else return temp > 0;

        });

        int x = 0;
        for (int k = 0; k < n; ++k) {
            if (stus[k].sum >= g) x++;
        }

        printf("%d\n", x);

        for (int l = 0; l < n; ++l) {
            if (stus[l].sum >= g) printf("%s %d\n", stus[l].id, stus[l].sum);
        }

    }

    return 0;
}

问题 I: 排名

原文：https://www.cnblogs.com/ailinal/p/12309651.html