Pagini recente » Cod sursa (job #691182) | Cod sursa (job #2653241) | Cod sursa (job #2737808) | Cod sursa (job #1017061) | Cod sursa (job #1508495)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int a[16005],n,k,i,vol,c,mid,l,r;
void cit()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
}
int check()
{
c=0;
for(i=1;i<=n;i++)
{
if(vol+a[i]<=mid)
{
vol+=a[i];
}
else
{
c++;
vol=a[i];
}
}
if(c>k){return 0;}
else{return 1;}
}
int main()
{
cit();
l=1;r=16000*16000;
mid=(l+r)/2;
while(l<r)
{
if(check()){r=mid-1;}
else{l=mid+1;}
mid=(l+r)/2;
}
fout<<mid<<"\n";
}