-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
53 lines (42 loc) · 1.26 KB
/
Solution.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
import java.util.Comparator;
import java.util.PriorityQueue;
class Student {
private final int id;
private final String name;
private final double cgpa;
public Student(int id, String name, double cgpa) {
this.id = id;
this.name = name;
this.cgpa = cgpa;
}
public int getID() {
return id;
}
public String getName() {
return name;
}
public double getCGPA() {
return cgpa;
}
}
class Priorities {
private final PriorityQueue<Student> queue = new PriorityQueue<>(
Comparator.comparing(Student::getCGPA).reversed()
.thenComparing(Student::getName)
.thenComparing(Student::getID));
public List<Student> getStudents(List<String> events) {
events.forEach((event) -> {
if (event.equals("SERVED")) {
queue.poll();
} else {
String[] details = event.split(" ");
queue.add(new Student(Integer.parseInt(details[3]), details[1], Double.parseDouble(details[2])));
}
});
List<Student> students = new ArrayList<>();
while (!queue.isEmpty()) {
students.add(queue.poll());
}
return students;
}
}