社区讨论

八十分求调

P5740【深基7.例9】最厉害的学生参与者 1已保存回复 0

讨论操作

快速查看讨论及其快照的属性,并进行相关操作。

当前回复
0 条
当前快照
1 份
快照标识符
@miinxc8g
此快照首次捕获于
2025/11/28 17:31
3 个月前
此快照最后确认于
2025/11/29 15:30
3 个月前
查看原帖
C
#include<stdio.h>
typedef struct {
	char name[8];
	int grade1;
	int grade2;
	int grade3;
}Student;
void readStudent(Student students[], int n)
{
	for (int i = 0; i < n; i++)
	{
		scanf("%s %d  %d %d", students[i].name, &students[i].grade1, &students[i].grade2, &students[i].grade3);
	}
}
int main()
{
	int N;
	scanf("%d", &N);
	Student students[1000];
	readStudent(students, N);
	int sum = 0;
	int h;
	for (int i = 0; i < N; i++)
	{
		int sum1 = students[i].grade1 + students[i].grade2 + students[i].grade3;
		if (sum1 > sum)
		{
			sum = sum1;
			h = i;//记住第一个最高成绩的同学
		}
	} 
	printf("%s %d %d %d", students[h].name, students[h].grade1, students[h].grade2, students[h].grade3);
	return 0;
}

回复

0 条回复,欢迎继续交流。

正在加载回复...