<awangdev>373. Find K Pairs with Smallest Sums_2.java
private PriorityQueue<List<Integer>> initQueue(int k) {

        return new PriorityQueue<>(k, new Comparator<List<Integer>>() {
            public int compare(List<Integer> a, List<Integer> b) {
                return b.get(0) + b.get(1) - a.get(0) - a.get(1);
            }
        });
    }
private PriorityQueue < List < Integer >> var_2 ( int var_3 ) {
  return new PriorityQueue < > ( var_3 , new Comparator < List < Integer >> ( ) {
    public int compare ( List < Integer > var_7 , List < Integer > var_8 ) {
      return var_8 . get ( 0 ) + var_8 . get ( 1 ) - var_7 . get ( 0 ) - var_7 . get ( 1 ) ;
    }
  }
  ) ;
}
