The simplest way would probably be making your own pair class and defining a custom comparator.

Still not available in Java standard library. So all you need is to switch to Scala :)

  import java.util.PriorityQueue
  
  val pq = new PriorityQueue[(Int, String)]
  pq.add((1, "one"))
  pq.add((2, "two"))

You need to create a java class for pair an implementation is given below :

class pair implements Comparable{ int a,b;

public pair(int a, int b) {
        this.a = a;
        this.b = b;
    }
    public int compareTo(pair o) {
        if(this.a==o.a)
            return this.b - o.b;
        return this.a - o.a;
    }
}

pair class implements comparable interface because priority queue will use this interface compareTo method to compare elements.

you can define priority queue as follows

PriorityQueue<pair> pq = new PriorityQueue<>();
    pq.add(new pair(1,2));

Abit weird method but if the numbers in your pair are small enough, you insert then into your priority queue by inserting a*(constant)+b.