**Java Priority Queue**

### Problem Statement :

In computer science, a priority queue is an abstract data type which is like a regular queue, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. - Wikipedia In this problem we will test your knowledge on Java Priority Queue. There are a number of students in a school who wait to be served. Two types of events, ENTER and SERVED, can take place which are described below. ENTER: A student with some priority enters the queue to be served. SERVED: The student with the highest priority is served (removed) from the queue. A unique id is assigned to each student entering the queue. The queue serves the students based on the following criteria (priority criteria): 1.The student having the highest Cumulative Grade Point Average (CGPA) is served first. 2.Any students having the same CGPA will be served by name in ascending case-sensitive alphabetical order. 3.Any students having the same CGPA and name will be served in ascending order of the id. Create the following two classes: The Student class should implement: The constructor Student(int id, String name, double cgpa). The method int getID() to return the id of the student. The method String getName() to return the name of the student. The method double getCGPA() to return the CGPA of the student. The Priorities class should implement the method List<Student> getStudents(List<String> events) to process all the given events and return all the students yet to be served in the priority order. Input Format The first line contains an integer, n, describing the total number of events. Each of the n subsequent lines will be of the following two forms: ENTER name CGPA id: The student to be inserted into the priority queue. SERVED: The highest priority student in the queue was served. The locked stub code in the editor reads the input and tests the correctness of the Student and Priorities classes implementation. Constraints 2<=n<=1000 0<=CGPA<=4.00 1<=id<=10^5 2<=|name|<=30 Output Format The locked stub code prints the names of the students yet to be served in the priority order. If there are no such student, then the code prints EMPTY.

### Solution :

` ````
Solution in C :
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;
}
}
```

## View More Similar Problems

## Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →## AND xor OR

Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value

View Solution →## Waiter

You are a waiter at a party. There is a pile of numbered plates. Create an empty answers array. At each iteration, i, remove each plate from the top of the stack in order. Determine if the number on the plate is evenly divisible ith the prime number. If it is, stack it in pile Bi. Otherwise, stack it in stack Ai. Store the values Bi in from top to bottom in answers. In the next iteration, do the

View Solution →## Queue using Two Stacks

A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic que

View Solution →## Castle on the Grid

You are given a square grid with some cells open (.) and some blocked (X). Your playing piece can move along any row or column until it reaches the edge of the grid or a blocked cell. Given a grid, a start and a goal, determine the minmum number of moves to get to the goal. Function Description Complete the minimumMoves function in the editor. minimumMoves has the following parameter(s):

View Solution →## Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

View Solution →