Pagini recente » Cod sursa (job #2646633) | Cod sursa (job #2515966) | Cod sursa (job #2594311) | Cod sursa (job #2915317) | Cod sursa (job #2394977)
#include <cstdio>
using namespace std;
const int NMAX = 16005;
int v[NMAX];
int n,k;
bool ok(int C)
{
int i,sc,tr;
sc = tr = 0;
for(i = 1;i <= n;i++)
{
if(v[i] > C)
return 0;
if(sc + v[i] <= C)
sc = sc + v[i];
else
{
tr++;
sc = v[i];
}
}
tr++;
return tr <= k;
}
int bs(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",bs(1,s));
return 0;
}