875

class Solution {
public:
    int minEatingSpeed(vector<int>& piles, int h) {
        int left=1, right=INT_MIN;
        for(auto num: piles)
            right = max(right, num);

        right++;
        while(left<right){
            int mid = (left+right)/2;
            if(check(mid, piles) > h)
                left = mid+1;
            else
                right = mid;
        }
        return left;
    }

    int check(int speed, vector<int>& piles){
        int time = 0;
        for(auto num: piles){
            time += int(ceil(1.0*num/speed));
        }
        return time;
    }

};