Pagini recente » Cod sursa (job #2082525) | Cod sursa (job #2338437) | Cod sursa (job #966119) | Cod sursa (job #283268) | Cod sursa (job #1502997)
#include<stdio.h>
using namespace std;
int n,k,sol;
int v[16001];
bool ok(int c)
{
int i=0,t=1,vol;
vol=c;
for(int i=0; i<n; i++)
{
if(c<v[i]) return 0;
if(vol>=v[i]) vol-=v[i];
else
{
t++;
vol=c;
}
}
if(t>k) return 0;
return 1;
}
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=0; i<n; i++) scanf("%d",&v[i]);
int pas=1<<16,start=0;
for(pas; pas>0; pas=pas>>1)
{
if(!ok(start+pas)) start+=pas;
else sol=start+pas;
}
printf("%d",sol);
}