Pagini recente » Cod sursa (job #2329238) | Cod sursa (job #970162) | Cod sursa (job #556826) | Cod sursa (job #404198) | Cod sursa (job #3160815)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int v[16001]={0};
short int n,i,maxi=-1,cnt=0,k;
int s=0,st,dr,m,rez;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
if(v[i]>maxi)
maxi=v[i];
s=s+v[i];
}
st=maxi;
dr=s;
while(st<=dr)
{
m=(st+dr)/2;
s=0;
cnt=1;
for(i=1;i<=n;i++)
{
if(s+v[i]<=m)
s=s+v[i];
else
{
cnt++;
s=v[i];
}
}
if(k>=cnt)
{
rez=m;
dr=m-1;
}
else
st=m+1;
}
cout<<rez;
return 0;
}