解题思路:
注意事项:
参考代码:
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
class Stu{
int id;
int chinese;
int math;
int english;
int sum;
public Stu(int id,int chinese,int math,int english) {
this.id = id;
this.chinese = chinese;
this.math = math;
this.english = english;
this.sum = chinese + math + english;
}
}
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Stu[] students = new Stu[n];
for (int i = 0; i < n; i++) {
students[i] = new Stu(i + 1, scanner.nextInt(), scanner.nextInt(), scanner.nextInt());
}
Arrays.sort(students,new Comparator<Stu>() {
@Override
public int compare(Stu stu1,Stu stu2) {
if (stu1.sum == stu2.sum ) {
if (stu1.chinese == stu2.chinese) {
return stu1.id - stu2.id;
}
else {
return stu2.chinese - stu1.chinese;
}
}
return stu2.sum - stu1.sum;
}
});
for (int i = 0; i < 5; i++) {
System.out.println(students[i].id + " " + students[i].sum);
}
}
}
0.0分
0 人评分
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程,并配有习题和答疑,点击了解:
一点编程也不会写的:零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码?手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程:算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程
发表评论 取消回复