priorityqueue-structure-for-store-object-in-it.java

// priority queue structure for store object in it 

import java.util.PriorityQueue;

public class Main{
    
    static class Student implements Comparable<Student>{ //Overriding
        String name;
        int rank;
        
        public Student(String name, int rank){
            this.name = name;
            this.rank = rank;
        }
        
    @Override
    public int compareTo(Student s2){
        return this.rank - s2.rank;
    }
        
    }
    
    public static void main(String[]args){
        
        PriorityQueue <Student> pq = new PriorityQueue<>();
        
        pq.add(new Student("A", 4));  // Tc = 0(log n)
        pq.add(new Student("B", 5));
        pq.add(new Student("C", 2));
        pq.add(new Student("D", 12));
        
        while(!pq.isEmpty()){
            System.out.println(pq.peek().name + "->"+ pq.peek().rank);  // 0(1)
            pq.remove();    //0 (log n)
        }
        
        
        
    }
}