-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathJava-priority-queue.java
99 lines (92 loc) · 2.48 KB
/
Java-priority-queue.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
//JAVA PRIORITY QUEUE
// 🟠 Medium
//https://www.hackerrank.com/challenges/java-priority-queue/problem?isFullScreen=true
// Tags: Data Structure
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
// import Priority Queue Collection Framework
import java.util.*;
/*
* Create the Student and Priorities classes here.
*/
class Student implements Comparable<Student>{
String name = new String();
double cgpa;
int id;
public Student(String name,double cgpa,int id)
{
this.name = name;
this.cgpa = cgpa;
this.id = id;
}
public String getName(){
return this.name;
}
public int compareTo(Student s)
{
if(cgpa == s.cgpa)
{
if(name.compareTo(s.name) == 0)
{
if(id == s.id)
return 0;
else if (id > s.id)
return 1;
else
return -1;
}
else
return name.compareTo(s.name);
}
else if(cgpa > s.cgpa)
return -1;
else
return 1;
}
}
class Priorities{
public ArrayList<Student> getStudents(List<String> events)
{
int n = events.size();
PriorityQueue<Student> pq = new PriorityQueue<Student>();
for(String i:events)
{
String[] s = new String[4];
s = i.split("\\s");
if(s.length>1)
{
pq.add(new Student(s[1],Double.valueOf(s[2]),Integer.valueOf(s[3])));
}
else
{
pq.poll();
}
}
while(pq.size()>1)
{
System.out.println(pq.poll().name);
}
return new ArrayList<Student>(pq);
}
}
public class Solution {
private final static Scanner scan = new Scanner(System.in);
private final static Priorities priorities = new Priorities();
public static void main(String[] args) {
int totalEvents = Integer.parseInt(scan.nextLine());
List<String> events = new ArrayList<>();
while (totalEvents-- != 0) {
String event = scan.nextLine();
events.add(event);
}
List<Student> students = priorities.getStudents(events);
if (students.isEmpty()) {
System.out.println("EMPTY");
} else {
for (Student st: students) {
System.out.println(st.getName());
}
}
}
}