leetcode

0 class Solution {

1 public:

2 int minEatingSpeed(vector<int> &piles, int h) {

3 int low = 1, high = INT_MAX, mid, count;

4 while (low < high) {

5 mid = low + (high - low) / 2, count = 0;

6 for (int pile : piles)

7 count += ceil((double)pile / mid);

8 if (count <= h)

9 high = mid;

10 else

11 low = mid + 1;

12 }

13 return low;

14 }

15 };