Pagini recente » Cod sursa (job #97690) | Cod sursa (job #2467051) | Cod sursa (job #2652570) | Cod sursa (job #2335888) | Cod sursa (job #2473122)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n, k;
int a[16005];
int i, s, cmax, st, dr, mij, suma, cnt, sol;
fin >> n >> k;
s = cmax = 0;
for(i = 1; i <= n; i++)
{
fin >> a[i];
s += a[i];
cmax = max(a[i], cmax);
}
st = cmax;
dr = s;
while(st <= dr)
{
mij = (st + dr) / 2;
suma = 0;
cnt = 1;
for(i = 1; i <= n; i++)
{
suma += a[i];
if(suma > mij)
{
suma = a[i];
cnt++;
}
}
if(cnt > k) st = mij + 1;
else
{
sol = mij;
dr = mij - 1;
}
}
fout << sol;
return 0;
}