Koko loves to eat bananas. There are n piles of bananas, the i-th pile has piles[i] bananas. The guards will come back in h hours.
Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses a pile and eats k bananas from it. If the pile has less than k bananas, she eats all of them and won't eat any more during that hour.
Return the minimum integer k such that she can eat all the bananas within h hours.
Example 1:
Input: piles = [3, 6, 7, 11], h = 8
Output: 4
Explanation: At speed 4, Koko eats: [1, 2, 2, 3] = 8 hours total.
Example 2:
Input: piles = [30, 11, 23, 4, 20], h = 5
Output: 30
Example 3:
Input: piles = [30, 11, 23, 4, 20], h = 6
Output: 23
1 <= piles.length <= 10^4piles.length <= h <= 10^91 <= piles[i] <= 10^9