Given k piles of bananas and H hours, each hour Koko picks one pile and eats up to her speed from it (finishing a smaller pile early). Return the minimum integer speed that lets her finish all piles within H hours. Input: '[piles], H'.
Input: '[piles], H'.
Output: Integer — the minimum speed.
Input: [3,6,7,11], 8
Output: 4
Explanation: Speed 4 finishes within 8 hours.Input: [30,11,23,4,20], 5
Output: 30
Explanation: Tight time budget.Input: [1], 1
Output: 1
Explanation: Single pile.1<=k<=10^4k<=H<=10^91<=pile<=10^9