-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathJava Sort.java
82 lines (71 loc) · 1.99 KB
/
Java Sort.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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/* *
* Author: Pavith Bambaravanage
* URL: https://github.com/Pavith19
* */
/*JAVA-15*/
import java.util.*;
class 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;
}
}
//Complete the code
//class CustomComparator implements Comparator<Student>{
// @Override
// public int compare(Student s1, Student s2){
// if (s1.getCgpa() < s2.getCgpa())
// return 1;
// if (s1.getCgpa() > s2.getCgpa())
// return -1;
// if (!Objects.equals(s1.getFname(), s2.getFname()))
// return s1.getFname().compareTo(s2.getFname());
// return s1.getId() - s2.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--;
}
studentList.sort(new Comparator<Student>() {
@Override
public int compare(Student o1, Student o2) {
if (o1.getCgpa() == o2.getCgpa()){
return o1.getFname().compareTo(o2.getFname());
} else if (o1.getCgpa() < o2.getCgpa()) {
return 1;
}
else {
return -1;
}
}
});
for(Student st: studentList){
System.out.println(st.getFname());
}
}
}