comefrom: <doocs>0875.Koko Eating Bananas_1.py
code: def minEatingSpeed( piles: List[int], h: int) -> int:
      left, right = 1, int(1e9)
      while left < right:
          mid = (left + right) >> 1
          s = sum((x + mid - 1) // mid for x in piles)
          if s <= h:
              right = mid
          else:
              left = mid + 1
      return left
masked: def sample_funcname ( var_0 : List [ int ] , var_1 : int ) -> int :
      var_2 , var_3 = 1 , int ( 1e9 )
      while var_2 < var_3 :
          var_4 = ( var_2 + var_3 ) >> 1
          var_6 = sum ( ( var_5 + var_4 - 1 ) // var_4 for var_5 in var_0 )
          if var_6 <= var_1 :
              var_3 = var_4
          else :
              var_2 = var_4 + 1
      return var_2
  