Pagini recente » Cod sursa (job #2941440) | Cod sursa (job #2741129) | Cod sursa (job #623941) | Cod sursa (job #379938) | Cod sursa (job #1385912)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, maxim, i, j, s[16010], c, cc, t, sum;
int main()
{
fin>>n>>k;
for (i=1;i<=n;i++) {
fin>>s[i];
if (s[i] > maxim)
maxim = s[i];
sum += s[i];
}
for (c = maxim; c <= sum; c++) {
// verific cate transporturi fac cu un camion de capacitate c
cc = c;
t = 1;
for (j=1;j<=n;j++) {
if (s[j] <= cc) {
cc -= s[j];
} else {
t++;
cc = c - s[j];
}
}
if (t <= k) {
break;
}
}
fout<<c;
return 0;
}