comefrom: <awangdev>215. Kth Largest Element in an Array_1.java
code: public int findKthLargest(int[] nums, int k) {
          if (nums == null || nums.length == 0) return -1;
  
          PriorityQueue<Integer> queue = new PriorityQueue<>(); 
          
          for (int i = 0; i < nums.length; i++) { 
              if (i < k || nums[i] > queue.peek()) queue.offer(nums[i]);
              if (queue.size() > k) queue.poll();
          }
          
          return queue.poll();
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    if ( var_0 == null || var_0 . length == 0 ) return - 1 ;
    PriorityQueue < Integer > var_2 = new PriorityQueue < > ( ) ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length ;
    var_3 ++ ) {
      if ( var_3 < var_1 || var_0 [ var_3 ] > var_2 . peek ( ) ) var_2 . offer ( var_0 [ var_3 ] ) ;
      if ( var_2 . size ( ) > var_1 ) var_2 . poll ( ) ;
    }
    return var_2 . poll ( ) ;
  }
  