-
Notifications
You must be signed in to change notification settings - Fork 21
Expand file tree
/
Copy pathSolution.java
More file actions
57 lines (50 loc) · 1.5 KB
/
Copy pathSolution.java
File metadata and controls
57 lines (50 loc) · 1.5 KB
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
57
import java.util.*;
class Student implements Comparable<Student> {
private int id;
private String fname;
private double cgpa;
public Student(int id, String fname, double cgpa) {
super();
this.id = id;
this.fname = fname;
this.cgpa = cgpa;
}
public int getId() {
return id;
}
public String getFname() {
return fname;
}
public double getCgpa() {
return cgpa;
}
public int compareTo(Student other) {
if (Double.compare(other.getCgpa(), this.getCgpa()) != 0) {
return Double.compare(other.getCgpa(), this.getCgpa());
} else if (this.getFname().compareTo(other.getFname()) != 0) {
return this.getFname().compareTo(other.getFname());
} else {
return Integer.compare(other.getId(), this.getId());
}
}
}
public class Solution {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int testCases = Integer.parseInt(in.nextLine());
List<Student> studentList = new ArrayList<Student>();
while(testCases>0){
int id = in.nextInt();
String fname = in.next();
double cgpa = in.nextDouble();
Student st = new Student(id, fname, cgpa);
studentList.add(st);
testCases--;
}
in.close();
studentList.sort(null);
for(Student st: studentList){
System.out.println(st.getFname());
}
}
}