Run

import java.util.*;
class Main
{
  static class Node
  {
    int data;
    int prioritydata;
    Node next;
  }
  static Node node = new Node ();
  static Node newNode (int d, int p)
  {
    Node tp = new Node ();
      tp.data = d;
      tp.prioritydata = p;
      tp.next = null;
      return tp;
  }

// Return the value at head

  static int peek (Node head)
  {

    return (head).data;

  }
//delete the element with the high priority

  static Node delete (Node head)
  {
    Node tp = head;
    (head) = (head).next;
    return head;

  }

// Function to insert element

  static Node insert (Node head, int d, int p)
  {
    Node start = (head);

    // Create new Node
    Node tp = newNode (d, p);
    if ((head).prioritydata > p)
      {

	// Insert New Node before head
	tp.next = head;
	(head) = tp;
      }

    else
      {
	while (start.next != null && start.next.prioritydata < p)
	  {
	    start = start.next;
	  }

	tp.next = start.next;
	start.next = tp;
      }
    return head;
  }
// Function to check is list is empty

  static int isEmpty (Node head)
  {
    return ((head) == null) ? 1 : 0;
  }

  // Driver code

  public static void main (String args[])
  {
    // Create a Priority Queue
    // 20 and 40 and 60 and 80

    Node pq = newNode (40, 1);
    pq = insert (pq, 80, 2);
    pq = insert (pq, 60, 3);
    pq = insert (pq, 20, 0);

    while (isEmpty (pq) == 0)
      {
	System.out.println (peek (pq));
	pq = delete (pq);
      }
  }
}

Output :
20
40
80
60