Pagini recente » Cod sursa (job #37036) | Cod sursa (job #834569) | Cod sursa (job #2623747) | Cod sursa (job #1098808) | Cod sursa (job #2810354)
#include <cstdio>
using namespace std;
const int NMAX=16005;
int v[NMAX];
int n,k;
bool ok(int c)
{
int tr=1,i=1,s=0;
while(i<=n)
{
if(v[i]>c)
return 0;
s=s+v[i];
if(s>c)
{
tr++;
s=v[i];
}
i++;
}
if(tr<=k)
return 1;
else
return 0;
}
int bsL(int st,int dr)
{
int med,last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int i,s=0;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
s=s+v[i];
}
printf("%d",bsL(1,s));
return 0;
}