hdu1.3.2
来源：互联网 发布：js pdf 预览插件 编辑：程序博客网 时间：2024/04/28 17:42
#include <stdio.h>#include <stdlib.h>#include <string.h>struct person{char id[21];int total;}p[1000];int cmp(const void* a, const void* b){struct person* pa = (struct person*)a;struct person* pb = (struct person*)b;if(pa->total != pb->total)return pb->total - pa->total;return strcmp(pa->id,pb->id);}int main(){int N,M,G,i,num,s,temp,j,stu;int score[11];while(scanf("%d",&N)==1,N){stu = 0;scanf("%d%d",&M,&G);for(i=1;i<=M;i++)scanf("%d",score+i);for(i=0;i<N;i++){scanf("%s%d",p[stu].id,&num);p[stu].total = 0;for(j=0;j<num;j++){scanf("%d",&temp);p[stu].total += score[temp];}if(p[stu].total >= G) stu++;}qsort(p,stu,sizeof(p[0]),cmp);printf("%d\n",stu);for(i=0;i<stu;i++)printf("%s %d\n",p[i].id,p[i].total);}}
