3 条题解
-
1
#include <stdio.h>
#include <string.h>
typedef struct jiangxuejin {
char a[101];
int average;
int pingyi;
char b;
char c;
int fabiao;
} S;
int main() {
int N;
scanf("%d", &N);
while (N--) {
int n;
scanf("%d", &n);
S stu[n];
int jxj[n];
for (int i = 0; i < n; i++) {
jxj[i] = 0;
scanf("%s %d %d", stu[i].a, &stu[i].average, &stu[i].pingyi);
getchar();
scanf("%c", &stu[i].b);
getchar();
scanf("%c", &stu[i].c);
getchar();
scanf("%d", &stu[i].fabiao);
if (stu[i].average > 90) {
jxj[i] += 2000;
}
if (stu[i].average > 80 && stu[i].fabiao >= 1) { jxj[i] += 8000; } if (stu[i].average > 85 && stu[i].pingyi > 80) {
jxj[i] += 4000;
}
if (stu[i].average > 85 && stu[i].c == 'Y') {
jxj[i] += 1000;
}
if (stu[i].pingyi > 80 && stu[i].b == 'Y') {
jxj[i] += 850;
}
}
int max = jxj[0], index = 0, sum = jxj[0];
for (int i = 1; i < n; i++) {
sum += jxj[i];
if (max < jxj[i]) {
max = jxj[i];
index = i;
}
}
printf("%s\n%d\n%d\n", stu[index].a,
jxj[index], sum);
}
return 0;
}
信息
- ID
- 141
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- 8
- 标签
- (无)
- 递交数
- 1310
- 已通过
- 196
- 上传者