Pagini recente » Cod sursa (job #1431353) | Cod sursa (job #1172259) | Cod sursa (job #2707529) | Monitorul de evaluare | Cod sursa (job #813089)
Cod sursa(job #813089)
#include<cstdio>
int n,k,i,a[16010],left,right,middle,s,p,sol;
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d %d",&n,&k);
left=16001;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(a[i]<left) left=a[i];
right+=a[i];
}
while(left<right)
{
s=0; p=0;
middle=(left+right)/2;
for(i=1;i<=n;i++)
{
if(s+a[i]<=middle) {s+=a[i];}
else {p++; s=a[i];}
}
p++;
if(p<=k)
{
sol=middle;
right=middle;
}
else
{
left=middle+1;
}
}
printf("%d\n",sol);
return 0;
}