-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathexpense.cpp
60 lines (56 loc) · 1.55 KB
/
expense.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
bool works(int N, int M, int (&expense)[100000], int mid){
int currmonth = 0;
int months = 1;
for(int i = 0; i < N; i++){
if(currmonth + expense[i] > mid){
months++;
currmonth = 0;
}
currmonth += expense[i];
if(currmonth > mid) return false;
}
if(months <= M) return true;
else return false;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, M; cin >> N >> M;
int expense[100000];
for(int i = 0; i < N; i++){
cin >> expense[i];
}
int lo = 0;
int hi = 1000000000;
int mid = 0;
while(lo < hi){
mid = lo + ((hi-lo) / 2);
bool ok = works(N, M, expense, mid);
if(ok){
hi = mid-1;
}else{
lo = mid+1;
}
}
while(works(N, M, expense, mid)){
mid--;
}
while(!works(N, M, expense, mid)){
mid++;
}
cout << mid << endl;
return 0;
}