Koko Eating Bananas LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minEatingSpeed(vector<int> &piles, int h) {
4
    int mx = 1000000001;
5

6
    int st = 1;
7

8
    while (mx > st) {
9
      int k = ((mx + st) / 2);
10

11
      int sum = 0;
12

13
      for (int i = 0; i < piles.size(); i++) {
14
        sum += ceil(1.0 * piles[i] / k);
15
      }
16

17
      if (sum > h) {
18
        st = k + 1;
19
      } else {
20
        mx = k;
21
      }
22
    }
23

24
    return st;
25
  }
26
};