Pagini recente » Cod sursa (job #2087439) | Cod sursa (job #1337812) | Cod sursa (job #2081255) | Cod sursa (job #2460735) | Cod sursa (job #1068310)
#include<cstdio>
using namespace std;
int n,k,v[16005],li=1,ls,s,nr,mij;
int main()
{
int i;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=1;i<=n;++i)
{
scanf("%d",&v[i]);
if (v[i]>ls) ls=v[i];
}
while(li<ls)
{
s=0;
nr=1;
mij=(li+ls)/2;
for (int i=1;i<=n;++i)
if (s+v[i]<=mij)
s+=v[i];
else
{
s=v[i];
++nr;
}
if (nr>k)
li=mij+1;
else
ls=mij;
}
printf("%d\n",li+1);
return 0;
}