Pagini recente » Cod sursa (job #3219685) | Cod sursa (job #901472) | Cod sursa (job #2409894) | Cod sursa (job #2826501) | Cod sursa (job #1232882)
#include <cstdio>
using namespace std;
int v[16005],n,k;
int verif(int capac)
{
int i, nr=1 ,suma=0 ;
for(i=1;i<=n;i++)
{
if(v[i]>capac)
return 0;
if(suma+v[i]<=capac)
suma+=v[i];
else
{
nr++;
suma=v[i];
}
}
return nr<=k;
}
int main ()
{
int i,j,dev;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
i=0;
dev=1<<27;
while(dev)
{
if(!verif(i+dev))
i+=dev;
dev/=2;
}
printf("%d\n",i+1);
return 0;
}