comefrom: <awangdev>373. Find K Pairs with Smallest Sums_2.java
code: 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);
              }
          });
      }
masked: private PriorityQueue < List < Integer >> var_0 ( int var_1 ) {
    return new PriorityQueue < > ( var_1 , new Comparator < List < Integer >> ( ) {
      public int compare ( List < Integer > var_2 , List < Integer > var_3 ) {
        return var_3 . get ( 0 ) + var_3 . get ( 1 ) - var_2 . get ( 0 ) - var_2 . get ( 1 ) ;
      }
    }
    ) ;
  }
  