Pagini recente » Cod sursa (job #2662898) | Cod sursa (job #536931) | Cod sursa (job #1935942) | Cod sursa (job #1144600) | Cod sursa (job #1276182)
#include <cstdio>
int v[16000];
int n,k;
using namespace std;
int ok(int C)
{
int tr=0,s=0,i;
for(i=1; i<=n; i++){
if(v[i]>C)
return 0;
s=s+v[i];
if(s>C){
tr++;
s=v[i];
}
}
if(s>0)
tr++;
return tr<=k;
}
int bs(int dr)
{
int st,last,med;
last=dr+1;
st=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 s=0,i;
scanf("%d%d", &n, &k);
for(i=1; i<=n; i++){
scanf("%d", &v[i]);
s=s+v[i];
}
printf("%d", bs(s));
return 0;
}