Minimized Maximum of Products Distributed to Any Store LeetCode solution in C++

1
class Solution {
2
 public:
3
  bool func(int N, int n, vector<int> &quantities) {
4
    int temp = 0;
5
    for (int id = 0; temp <= n && id != quantities.size(); id++)
6
      temp += quantities[id] / N + (quantities[id] % N ? 1 : 0);
7

8
    return temp <= n;
9
  }
10

11
  int minimizedMaximum(int n, vector<int> &quantities) {
12
    int l = 1, r = *max_element(quantities.begin(), quantities.end());
13

14
    for (int m = (l + r) >> 1; l <= r; m = (l + r) >> 1)
15
      func(m, n, quantities) ? r = m - 1 : l = m + 1;
16

17
    return l;
18
  }
19
};