[C++] Load Balancing

#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <algorithm>
#include <queue>
#include <sstream>
#include <iostream>
#include <numeric>


using namespace std;


class Solution {
public:
	int solution(int n, int m, vector<int>& burstTime) {
		int ret = accumulate(burstTime.begin(), burstTime.end(), 0);
		int left = *max_element(burstTime.begin(), burstTime.end());
		int right = ret;
		while (left <= right) {
			int mid = (left + right) / 2;
			int k = num_groups(burstTime, mid);
			if (k <= n) {
				ret = min(ret, mid);
				right = mid - 1;
			}
			else {
				left = mid + 1;
			}
		}
		return ret;
	}

	int num_groups(vector<int>& burstTime, int limit) {
		int cnt = 0;
		int total = 0;
		for (int t : burstTime) {
			total += t;
			if (total > limit) {
				cnt++;
				total = t;
			}
		}
		return cnt + 1;
	}

};


void main() {
	int n = 3;
	vector<int> vec1 = { 7, 2, 3, 4, 5 };
	cout << Solution().solution(3, vec1.size(), vec1) << endl;

	n = 2;
	vector<int> vec2 = { 9, 2, 4, 4, 5};
	cout << Solution().solution(2, vec2.size(), vec2) << endl;
}