Pagini recente » Cod sursa (job #1923323) | Cod sursa (job #1662781) | Cod sursa (job #299525) | Cod sursa (job #2101002) | Cod sursa (job #1038132)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n,i,v[16001],m,k,c,d;
fin>>n;
fin>>k;
int s=0,st=0,dr;
for (i=1;i<=n;i++)
{
fin>>v[i];
s+=v[i];
if (v[i]>st)
st=v[i];
}
dr=2*s;
while (st<=dr)
{
c=0;
d=1;
m=(st+dr)/2;
for (i=1;i<=n;i++)
if (c+v[i]<=m)
c+=v[i];
else
{
c=v[i];
d++;
}
if (d>k)
st=m+1;
else
dr=m-1;
}
fout<<st;
return 0;
}