Pagini recente » Cod sursa (job #2618019) | Cod sursa (job #2274994) | Cod sursa (job #1543287) | Cod sursa (job #2407757) | Cod sursa (job #3160808)
#include <fstream>
using namespace std;
int v[16001];
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int main()
{
int n,i,st,dr,max=0,s=0,k,m,s1,cnt,r;
cin>>n>>k;
for (i=1; i<=n; i++)
{
cin>>v[i];
s+=v[i];
if (v[i]>max) max=v[i];
}
st=max;
dr=s;
while (st<=dr)
{
r=-1;
s1=0;
cnt=1;
m=(st+dr)/2;
for (i=1; i<=n; i++)
{
if (s1+v[i]<=m)
{
s1+=v[i];
}
else
{
s1=v[i];
cnt++;
}
}
if (cnt<=k)
{
r=m;
dr=m-1;
}
else st=m+1;
}
cout<<r<<endl;
return 0;
}