Pagini recente » Cod sursa (job #1891870) | Cod sursa (job #272370) | Cod sursa (job #2298188) | Cod sursa (job #1780539) | Cod sursa (job #2370330)
#include <bits/stdc++.h>
using namespace std;
int salt[16005];
int n, k;
bool enough(int vol){
int sum = 0, cnt = 0;
for(int i = 1; i <= n; ++i){
if(vol < salt[i])
return 0;
if(sum + salt[i] > vol){
sum = 0;
cnt++;
}
sum += salt[i];
}
if(sum)
cnt++;
return (cnt <= k);
}
int main()
{
ifstream fin("transport.in");
ofstream fout("transport.out");
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> salt[i];
int rez = 0, pas = 1 << 30;
while(pas){
if(!enough(rez + pas))
rez += pas;
pas /= 2;
}
fout << rez + 1;
return 0;
}