Pagini recente » Cod sursa (job #2832106) | Cod sursa (job #3131674) | Cod sursa (job #666531) | Cod sursa (job #2591266) | Cod sursa (job #2776960)
#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16005],n,k,sol,st,dr,mid,i,mx;
int main()
{
fin>>n>>k;
mx=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
if(mx<v[i]) mx=v[i];
}
st=mx;dr=10000000;
while(st<=dr)
{
mid=(st+dr)/2;
int nr=1;
int ok=0;
for( i=1;i<=n;i++)
{
if(ok+v[i]<=mid)
ok+=v[i];
else
{
ok=v[i];
nr++;
}
}
if(nr<=k)
{
sol=mid;
dr=mid-1;
}
else st=mid+1;
}
fout<<sol<<'\n';
return 0;
}