<p>Koko loves to eat bananas. There are <code>n</code> piles of bananas, the <code>i<sup>th</sup></code> pile has <code>piles[i]</code> bananas. The guards have gone and will come back in <code>h</code> hours.</p>

<p>Koko can decide her bananas-per-hour eating speed of <code>k</code>. Each hour, she chooses some pile of bananas and eats <code>k</code> bananas from that pile. If the pile has less than <code>k</code> bananas, she eats all of them instead and will not eat any more bananas during this hour.</p>

<p>Koko likes to eat slowly but still wants to finish eating all the bananas before the guards return.</p>

<p>Return <em>the minimum integer</em> <code>k</code> <em>such that she can eat all the bananas within</em> <code>h</code> <em>hours</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> piles = [3,6,7,11], h = 8
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> piles = [30,11,23,4,20], h = 5
<strong>Output:</strong> 30
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> piles = [30,11,23,4,20], h = 6
<strong>Output:</strong> 23
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= piles.length &lt;= 10<sup>4</sup></code></li>
	<li><code>piles.length &lt;= h &lt;= 10<sup>9</sup></code></li>
	<li><code>1 &lt;= piles[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    bool check(vector<int>& piles, int h, int n){
        long long c = 0;
        vector<int> temp;
        temp = piles;
        for(int i=0;i<temp.size();i++){
            if(temp[i]<=n){
                if(temp[i]!=0){
                    c++;
                }
            }else{
                c = c + temp[i]/n;
                temp[i] = temp[i]%n;
                i--;
            }
        }
        if(c<=h){
            return true;
        }else{
            return false;
        }
    }
    int minEatingSpeed(vector<int>& piles, int h) {
        sort(piles.begin(), piles.end());
        int num = 0;
        int numi = 0;
        bool isc = false;
        if(piles.size() == h){
            return piles[piles.size()-1];
        }
        for(int i=0;i<piles.size();i++){
            if(check(piles,h,piles[i])){
                num = piles[i];
                numi = i;
                break;
            }
        }
        if(numi!=0){
            int i = piles[numi];
            int j = piles[numi-1];
            while(i>=j && i-1!=j){
                if(check(piles,h,(i+j)/2)){
                    i = (i+j)/2;
                }else{
                    j = (i+j)/2;
                }
            }
            if(j>0){
                if(check(piles,h,j)){
                    return j;
                }
            }
            return i;
        }else{
            int i = piles[numi];
            int j = 0;
            while(i>=j && i-1!=j){
                if(check(piles,h,(i+j)/2)){
                    i = (i+j)/2;
                }else{
                    j = (i+j)/2;
                }
            }
            if(j>0){
                if(check(piles,h,j)){
                    return j;
                }
            }
            return i;
        }
        return num;
    }
};
32800