#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct Student
{
char s[25];
int sum;
}stu[1005];
bool cmp(Student a, Student b)
{
if (a.sum != b.sum)
return a.sum > b.sum;
return strcmp(a.s, b.s) > 0 ? 0 : 1;
}
int main()
{
int n, m, g, num;
int a[15];
while (scanf("%d", &n) != EOF && n)
{
int count = 0;
scanf("%d%d", &m, &g);
for (int i = 1; i <= m; i++)
{
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++)
{
stu[i].sum = 0;
scanf("%s%d", stu[i].s, &num);
while (num--)
{
int t;
scanf("%d", &t);
stu[i].sum = stu[i].sum + a[t];
}
if (stu[i].sum >= g)
count++;
}
printf("%d\n", count);
sort(stu+1, stu + n+1, cmp);
if (count)
{
for (int i = 1; i <= count; i++)
{
printf("%s %d\n", stu[i].s, stu[i].sum);
}
}
}
return 0;
}
今天的上机考试虽然有实时的Ranklist,但上面的排名只是根据完成的题数排序,没有考虑
每题的分值,所以并不是最后的排名。给定录取分数线,请你写程序找出最后通过分数线的
考生,并将他们的成绩按降序打印。
Input
测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 < N
< 1000 )、考题数M ( 0 < M < = 10 )、分数线(正整数)G;第2行排序给出第1题至第M题的正整数分值;以下N行,每行给出一
名考生的准考证号(长度不超过20的字符串)、该生解决的题目总数m、以及这m道题的题号
(题目号由1到M)。
当读入的考生人数为0时,输入结束,该场考试不予处理。
Output
对每场考试,首先在第1行输出不低于分数线的考生人数n,随后n行按分数从高
到低输出上线考生的考号与分数,其间用1空格分隔。若有多名考生分数相同,则按他们考
号的升序输出。
Sample Input
4 5 25
10 10 12 13 15
CS004 3 5 1 3
CS003 5 2 4 1 3 5
CS002 2 1 2
CS001 3 2 3 5
1 2 40
10 30
CS001 1 2
2 3 20
10 10 10
CS000000000000000001 0
CS000000000000000002 2 1 2
0
Sample Output
3
CS003 60
CS001 37
CS004 37
0
1
CS000000000000000002 20
Hint
Huge input, scanf is recommended.
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct Student
{
char s[25];
int sum;
}stu[1005];
Student p;//定义一个结构体包含学号与总分
int main()
{
int n, m, g,num;
int a[15];
while (scanf("%d", &n)!=EOF && n)
{
int count = 0;
scanf("%d%d", &m, &g);
for (int i = 1; i <= m; i++)
{
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++)
{
stu[i].sum = 0;
scanf("%s%d", stu[i].s, &num);
while (num--)
{
int t;
scanf("%d", &t);
stu[i].sum = stu[i].sum+a[t];
}
//计算每个学生的总分
if (stu[i].sum >= g)
count++;
}
printf("%d\n", count);
for (int i = 1; i <= n - 1; i++)
{
for (int j = i + 1; j <= n; j++)
{
if (stu[i].sum <= stu[j].sum)
{
if (stu[i].sum < stu[j].sum)
{
p = stu[i];
stu[i] = stu[j];
stu[j] = p;
}//按成绩从大到小排序
else if(stu[i].sum == stu[i].sum)
{
if (strcmp(stu[i].s, stu[j].s)>0)
//规则
当s1<s2时,返回为负数;
当s1==s2时,返回值= 0;
当s1>s2时,返回正数。
{
p = stu[i];
stu[i] = stu[j];
stu[j] = p;
}
}//成绩相同时按学号从小到大排序
}
}
}
if (count)
{
for (int i = 1; i <= count; i++)
{
printf("%s %d\n", stu[i].s, stu[i].sum);
}
}
}
return 0;
}
下次用sort函数试试排序
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct Student
{
char s[25];
int sum;
}stu[1005];
bool cmp(Student a, Student b)
{
if (a.sum != b.sum)
return a.sum > b.sum;
return strcmp(a.s, b.s) > 0 ? 0 : 1;
}
int main()
{
int n, m, g, num;
int a[15];
while (scanf("%d", &n) != EOF && n)
{
int count = 0;
scanf("%d%d", &m, &g);
for (int i = 1; i <= m; i++)
{
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++)
{
stu[i].sum = 0;
scanf("%s%d", stu[i].s, &num);
while (num--)
{
int t;
scanf("%d", &t);
stu[i].sum = stu[i].sum + a[t];
}
if (stu[i].sum >= g)
count++;
}
printf("%d\n", count);
sort(stu+1, stu + n+1, cmp);
if (count)
{
for (int i = 1; i <= count; i++)
{
printf("%s %d\n", stu[i].s, stu[i].sum);
}
}
}
return 0;
}