Pagini recente » Cod sursa (job #829334) | Cod sursa (job #1289609) | Cod sursa (job #474646) | Cod sursa (job #2473118) | Cod sursa (job #1068306)
//horatiu11
# include <cstdio>
# include <iostream>
# define nmax 16001
using namespace std;
int a[nmax],n,k;
int st,dr=nmax*nmax;
int main()
{
int i,sum,val,mij;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)
{
scanf("%d",&a[i]);
st=max(st,a[i]);
}
while(st<dr)
{
sum=0;val=1;
mij=(st+dr)>>1;
for(i=1;i<=n;++i)
if(sum+a[i]<=mij)sum+=a[i];
else sum=a[i],++val;
if (val>k)st=mij+1;
else dr=mij;
}
printf("%d\n",st);
return 0;
}