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_3 : int ) -> int :
      var_5 , var_7 = 1 , int ( 1e9 )
      while var_5 < var_7 :
          var_8 = ( var_5 + var_7 ) >> 1
          var_11 = sum ( ( var_10 + var_8 - 1 ) // var_8 for var_10 in var_0 )
          if var_11 <= var_3 :
              var_7 = var_8
          else :
              var_5 = var_8 + 1
      return var_5
  