Pagini recente » Cod sursa (job #1122421) | Cod sursa (job #692607) | Cod sursa (job #1465869) | Cod sursa (job #431692) | Cod sursa (job #284346)
Cod sursa(job #284346)
#include<stdio.h>
int n,k;
int v[16010];
void read()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
}
int rez(long c)
{
int i;
long s=0,nr=0;
for(i=1;i<=n;i++)
{
if(s+v[i]>c)
{
s=0;
nr++;
}
s=s+v[i];
}
nr++;
return nr<=k;
}
void cautare()
{
long st=1,dr=2000000000,m;
while(st!=dr)
{
m=(st+dr)>>1;
if(rez(m))
dr=m;
else
st=m+1;
}
printf("%ld\n",st);
}
int main()
{
read();
cautare();
return 0;
}