-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathJavaSort.java
56 lines (46 loc) Β· 1.4 KB
/
JavaSort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// https://www.hackerrank.com/challenges/java-sort
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
public class JavaSort {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int testCases = Integer.parseInt(in.nextLine());
List<Student> studentList = new ArrayList<>();
while(testCases-- > 0){
int id = in.nextInt();
String name = in.next();
double cgpa = in.nextDouble();
studentList.add(new Student(id, name, cgpa));
}
studentList.sort(
Comparator.comparing(Student::getCgpa).reversed()
.thenComparing(Student::getName)
.thenComparing(Student::getId)
);
for(Student student: studentList){
System.out.println(student.getName());
}
}
private static class Student{
private int id;
private String name;
private double cgpa;
public Student(int id, String name, double cgpa) {
super();
this.id = id;
this.name = name;
this.cgpa = cgpa;
}
public int getId() {
return id;
}
public String getName() {
return name;
}
public double getCgpa() {
return cgpa;
}
}
}