Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<vector>
- using namespace std;
- int minWeightCap(vector<int> &v, int days){
- int l = 0, r = 0, res = 0;
- for(int i = 0; i < (int) v.size(); i++){
- l = max(l, v[i]);
- r += v[i];
- }
- while(l <= r){
- int mid = l + (r - l) / 2;
- int daysReq = 1, weightSum = 0;
- for(int i = 0; i < (int) v.size(); i++){
- weightSum += v[i];
- if(weightSum > mid){
- daysReq++;
- weightSum = v[i];
- }
- }
- if(daysReq <= days){
- res = mid;
- r = mid - 1;
- }
- else{
- l = mid + 1;
- }
- }
- return res;
- }
- int main()
- {
- int n;
- cin >> n;
- vector<int> v(n);
- for(int i = 0; i < n; i++)
- cin >> v[i];
- int days;
- cin >> days;
- cout << minWeightCap(v, days) << '\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
