Pagini recente » Cod sursa (job #2031059) | Cod sursa (job #3158393) | Borderou de evaluare (job #2297029) | Cod sursa (job #2606248) | Cod sursa (job #2366671)
#include <bits/stdc++.h>
using namespace std;
int salt[16005];
int main()
{
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k;
fin >> n >> k;
for(int i = 1; i <= n; ++i)
fin >> salt[i];
int rez = 0, pas = 1 << 30;
while(pas){
int sum = 0, cnt = 0;
for(int i = 1; i <= n; ++i){
if(sum + salt[i] <= rez + pas)
sum += salt[i];
else{
sum = salt[i];
cnt++;
}
}
cnt++;
if(cnt > k)
rez += pas;
pas /= 2;
}
fout << rez + 1;
return 0;
}