Pagini recente » Cod sursa (job #91423) | Cod sursa (job #3295498)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
int main()
{
int n,k,s=0,max=0;
fin>>n>>k;
for(int i=1; i<=n; i++)
{
fin>>v[i];
}
for(int i=1; i<=n; i++)
{
s+=v[i];
if(v[i]>max)
{
max=v[i];
}
}
int st=max,dr=s,capacitate;
while(st<=dr)
{
int mijl=(st+dr)/2;
int s1=0,cnt=1;
for(int i=1; i<=n; i++)
{
if(s1+v[i]<=mijl)
{
s1+=v[i];
}
else
{
cnt++;
s1=v[i];
}
}
if(cnt>k)
{
st=mijl+1;
}
else
{
dr=mijl-1;
capacitate=mijl;
}
}
fout<<capacitate;
return 0;
}