Pagini recente » Cod sursa (job #1848617) | Cod sursa (job #152949) | Cod sursa (job #2267524) | Cod sursa (job #628948) | Cod sursa (job #1113295)
#include <cstdio>
using namespace std;
int v[16001];
int main()
{
int i,med,k,n,st,dr,tr,s,min=0;
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=s+v[i];
}
st=1;
dr=s;
while(st<=dr)
{
s=0;
tr=0;
med=st+(dr-st)/2;
for(i=1;i<=n;i++)
{
s=s+v[i];
if(v[i]>med)
{
tr=k+1;
break;
}
if(s+v[i+1]>med)
{
tr++;
s=0;
}
}
tr++;
if(tr<=k)
{
min=med;
dr=med-1;
}
else
st=med+1;
}
printf("%d",min);
return 0;
}