题目描述今天浙大研究生复试的上机考试跟传统笔试的打分规则相似,总共有n道题,每道题有对应分值,最后计算总成绩。现给定录取分数线,请你写程序找出最后通过分数线的考生,并将他们的成绩按降序打印。
输入第1行给出考生人数N ( 1<= N<=100 )、考题数M (1<=M<=10 )、分数线(正整数)G;
第2行排序给出第1题至第M题的正整数分值;
以下N行,每行给出一名考生的准考证号(长度不超过20的字符串)、该生解决的题目总数m、以及这m道题的题号
(题目号由1到M)。
输出首先在第1行输出不低于分数线的考生人数n,随后n行按分数从高到低输出上线考生的考号与分数,其间用1空格分隔。若有多名考生分数相同,则按他们考号的升序输出。
样例输入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
样例输出3
CS003 60
CS001 37
CS004 37
模拟即可
#include<stdio.h>
#include<string.h>
#define swap(a,b,t){ t=a; a=b; b=t;}
struct k{
char a[30];
int x;
int sum;
};
int main(){
int N, M, G, c;
int i, j, f[20];
scanf("%d%d%d", &N, &M, &G);
for (i = 0; i < M; i++)
scanf("%d", &f[i]);
k b[100], t;
for (i = 0; i < N; i++)
{
b[i].sum = 0;
scanf("%s%d", b[i].a, &b[i].x);
for (j = 0; j < b[i].x; j++)
{
scanf("%d", &c);
b[i].sum += f[c - 1];
}
}
for (int k = 0; k < N; k++) //排序
for (j = 0; j < N - 1 - k; j++){
if (b[j].sum < b[j + 1].sum)swap(b[j], b[j + 1], t);
if (b[j].sum == b[j + 1].sum){
if (strcmp(b[j].a, b[j + 1].a)>0)
swap(b[j], b[j + 1], t);
}
}
int count = 0;
for (i = 0; i < N; i++){
if (b[i].sum >= G)
count++;
else break;
}
printf("%d\n", count);
for (i = 0; i < N; i++){
if (b[i].sum < G)break;
printf("%s %d\n", b[i].a, b[i].sum);
}
return 0;
}
import java.util.Arrays;
import java.util.Scanner;
class node
{
String name;
int sum;
}
public class Main
{
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
int[] s = new int[20];
node[] a = new node[1110];
for (int i = 1; i <= 1000; i++)
a[i] = new node();
int n, m, g, x = 0;
n = cin.nextInt();
m = cin.nextInt();
g = cin.nextInt();
for (int i = 1; i <= m; i++)
{
s[i] = cin.nextInt();
}
for (int i = 1; i <= n; i++)
{
int sum = 0;
String name = cin.next();
int k = cin.nextInt();
for (int j = 1; j <= k; j++)
{
int d;
d = cin.nextInt();
sum += s[d];
}
node use = new node();
use.name = name;
use.sum = sum;
a[++x] = use;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n - i; j++)
{
if (a[j].sum == a[j + 1].sum)
{
if (a[j].name.compareTo(a[j + 1].name) > 0)
{
node t = a[j + 1];
a[j + 1] = a[j];
a[j] = t;
}
}
else
if (a[j].sum < a[j + 1].sum)
{
node t = a[j + 1];
a[j + 1] = a[j];
a[j] = t;
}
}
int cnt = 0;
for (int i = 1; i <= n; i++)
{
if (a[i].sum < g)
break;
else
cnt++;
}
System.out.println(cnt);
for (int i = 1; i <= cnt; i++)
System.out.println(a[i].name + " " + a[i].sum);
}
}