參考資訊:
https://www.cnblogs.com/grandyang/p/10807121.html
題目:

解答:
int minEatingSpeed(int *piles, int pilesSize, int h)
{
int cc = 0;
int left = 1;
int right = 1000000000;
while (left < right) {
int cnt = 0;
int m = left + ((right - left) >> 1);
for (cc = 0; cc < pilesSize; cc++) {
cnt += (piles[cc] / m);
cnt += !!(piles[cc] % m);
}
if (cnt > h) {
left = m + 1;
}
else {
right = m;
}
}
return right;
}