解题思路:
注意事项:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct student
{
char id[21];
int problem[11];
int score;
}student;
int compare(const void* a, const void* b)
{
student A = *(student*)a;
student B = *(student*)b;
if (A.score != B.score)
return B.score - A.score;
else
return strcmp(A.id, B.id);
}
int main()
{
int n, m, g;
while (scanf("%d", &n) == 1)
{
if (n == 0)
break;
scanf("%d %d", &m, &g);
int i,numscore[11],num,j;
for (i = 0; i < m; i++)
{
scanf("%d", &numscore[i]);
}
student x[1001];
for (i = 0; i < n; i++)
{
x[i].score = 0;
scanf("%s %d", x[i].id, &num);
for (j = 0; j < num; j++)
{
scanf("%d", &x[i].problem[j]);
x[i].score += numscore[x[i].problem[j]-1];
}
}
qsort(x, n, sizeof(student), compare);
int sum = 0;
for (i = 0; i < n; i++)
{
if (x[i].score >= g)
sum++;
}
printf("%d\n", sum);
for (i = 0; i < n; i++)
{
if (x[i].score >= g)
printf("%s %d\n", x[i].id, x[i].score);
}
}
return 0;
}
参考代码:
0.0分
0 人评分
淘淘的名单 (C语言代码)答案错误???浏览:595 |
【排队买票】 (C语言代码)浏览:900 |
【蟠桃记】 (C语言代码)浏览:664 |
剪刀石头布 (C语言代码)浏览:752 |
简单的a+b (C语言代码)浏览:577 |
完数 (C语言代码)浏览:693 |
核桃的数量 (C语言代码)浏览:671 |
蓝桥杯历届试题-翻硬币 (C++代码)浏览:883 |
C语言程序设计教程(第三版)课后习题7.3 (C语言代码)浏览:533 |
C语言程序设计教程(第三版)课后习题8.3 (C语言代码)浏览:539 |