Pagini recente » Cod sursa (job #669901) | Cod sursa (job #1739526) | Cod sursa (job #655166) | Cod sursa (job #2631238) | Cod sursa (job #2388037)
#include <cstdio>
using namespace std;
const int NMAX=16000;
int n,k,v[NMAX+5];
int ok(int c)
{
int i,s=0,tr=0;
for(i=1;i<=n;i++)
{
if(v[i]>c)
return NMAX+1;
if(s+v[i]<=c)
s=s+v[i];
else
{
s=v[i];
tr++;
}
}
tr++;
return tr;
}
int bsl(int st,int dr)
{
int med,last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med)<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i,s;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
s=0;
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
s+=v[i];
}
printf("%d\n",bsl(1,s));
return 0;
}