结构体排序 1236

#include <bits/stdc++.h>
using namespace std;
#define MXN 1010
struct sStudent{ char n[25]; int g = 0;} s[MXN];
int main(){
    int cnt, N, M, m, G, g, ms[15];    
    while(scanf("%d", &N), N){
        scanf("%d %d", &M, &G);
        for(int i = 1; i <= M; i++) scanf("%d", ms+i);
        cnt = 0;
        for(int i = 1; i <= N; i++){
            s[i].g = 0;
            scanf("%s %d", s[i].n, &m); 
            for(int k = 1; k <= m; k++)
                scanf("%d", &g), s[i].g += ms[g];
            if(s[i].g >= G) cnt++;
        }
        sort(s+1, s+N+1, [](sStudent x, sStudent y){//sort() 函数对结构体中的分数进行从大到小排序的使用
            if(x.g == y.g) return strcmp(x.n, y.n) < 0;
            return x.g > y.g;
        });
        printf("%d\n", cnt);
        for(int i = 1; i <= N && s[i].g >= G; i++)
        	printf("%s %d\n", s[i].n, s[i].g);
    }
    return 0;
}

添加链接描述