Pagini recente » Cod sursa (job #2750600) | Cod sursa (job #3254756) | Cod sursa (job #303222) | Cod sursa (job #3210789) | Cod sursa (job #1000462)
#include<fstream>
using namespace std;
int v[16001];
int main()
{
int n,k,i,s=0,max=0,l1,l2,nr,m;
ifstream in("transport.in");
ofstream out("transport.out");
in>>n;
in>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
s=s+v[i];
if(v[i]>max)
max=v[i];
}
l1=max;
l2=s;
while(l1<=l2)
{
m=(l1+l2)/2;
nr=1;
s=0;
for(i=1;i<=n;i++)
{
if(s+v[i]<=m)
s=s+v[i];
else
{
nr++;
s=v[i];
}
}
if(nr<=k)
l2=m-1;
else
l1=m+1;
}
if(k*k==n) out<<l2;
else out<<l1;
return 0;
}