Pagini recente » Cod sursa (job #2952841) | Cod sursa (job #729435) | Istoria paginii runda/123456789012 | Cod sursa (job #1504493) | Cod sursa (job #1378390)
#include <cstdio>
int v[16001];
int main(){
freopen("transport.in" , "r" , stdin);
freopen("transport.out" , "w" , stdout);
int n, k, i, st=-1, dr=0, mij, cate, x, s;
scanf("%d %d" , &n, &k);
for(i=1; i<=n; i++)
{
scanf("%d" , &v[i]);
dr=dr+v[i];
if(st<v[i])
st=v[i];
}
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
cate=1;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(mij<s)
{
s=v[i];
cate++;
}
}
if(cate<=k)
{
dr=mij-1;
x=mij;
}
else
{
st=mij+1;
x=mij+1;
}
}
printf("%d" , x);
return 0;
}