Koko has several piles of bananas and h hours. At an integer speed k, she spends one hour consuming up to k bananas from one pile.
Return the smallest speed that lets her finish every pile within h hours.
Inputpiles = [3, 6, 7, 11], h = 8
Output4
Inputpiles = [30, 11, 23, 4, 20], h = 5
Output30
1 ≤ piles.length ≤ h ≤ 100,0001 ≤ piles[i] ≤ 1,000,000,000