comefrom: <qiyuangong>1539_Kth_Missing_Positive_Number_1.java
code: public int findKthPositive(int[] a, int k) {
          int B[] = new int[a.length];
  
          for (int i = 0; i < a.length; i++)
              B[i] = a[i] - i - 1; // -1 is done as here missing numbers start from 1 and not 0
  
  
          int lo = 0, hi = B.length - 1;
  
          while (lo <= hi) {
              int mid = lo + (hi - lo) / 2;
  
              if (B[mid] >= k)
                  hi = mid - 1;
              else
                  lo = mid + 1;
          }
  
  
          return lo + k;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int var_2 [ ] = new int [ var_0 . length ] ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length ;
    var_3 ++ ) var_2 [ var_3 ] = var_0 [ var_3 ] - var_3 - 1 ;
    int var_4 = 0 , var_5 = var_2 . length - 1 ;
    while ( var_4 <= var_5 ) {
      int var_6 = var_4 + ( var_5 - var_4 ) / 2 ;
      if ( var_2 [ var_6 ] >= var_1 ) var_5 = var_6 - 1 ;
      else var_4 = var_6 + 1 ;
    }
    return var_4 + var_1 ;
  }
  