static class Node implements Comparable<Node> {
int n, w;
public Node(int n, int w) {
this.n = n;
this.w = w;
}
@Override
public int compareTo(Node node) {
return Integer.compare(this.w, node.w);
}
}
Queue<int[]> queue = new LinkedList<>();
queue.add(new int[]{1, 2, 3});
queue.add(new int[]{4, 5, 6});