Priority Queue Implementation using Array

import java.util.*;
class Main{
    public static void main(String args[])
    {

        PriorityQueue pQueue =
                new PriorityQueue(Collections.reverseOrder());

        // Adding items to the pQueue using add() 
        pQueue.add(80);
        pQueue.add(60);
        pQueue.add(40);
        pQueue.add(20);

        // Printing the most priority element 
        System.out.println("Head value is:" +
            pQueue.peek());

        // Printing all elements 
        System.out.println("The queue elements:");
        Iterator itr = pQueue.iterator();
        while (itr.hasNext())
            System.out.println(itr.next());

        // Removing the top priority element (or head) and 

        pQueue.poll();
        System.out.println("After removing an element "
                + "with poll function:");
        Iterator itr2 = pQueue.iterator();
        while (itr2.hasNext())
            System.out.println(itr2.next());

        // Removing 60 using remove() 
        pQueue.remove(60);
        System.out.println("after removing 60 with"
                + " remove function:");
        Iterator itr3 = pQueue.iterator();
        while (itr3.hasNext())
            System.out.println(itr3.next());


        Object[] arr = pQueue.toArray();
        System.out.println("Value in array: ");
        for (int i = 0; i < arr.length; i++)
            System.out.println("Value:"  + arr[i].toString());
    }
}

Output :
Head value is:80
The queue elements:
80
60
40
20
After removing an element with poll function:
60
20
40
after removing 60 with remove function:
40
20
Value in array: 
Value:40
Value:20