Pagini recente » Cod sursa (job #2983199) | Cod sursa (job #1359105) | Cod sursa (job #1100963) | Cod sursa (job #3285510) | Cod sursa (job #2679654)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("transport.in");
ofstream cout ("transport.out");
int n,k,v[16005],val;
bool ok(int med)
{
int i,sc,nrtr;
sc=nrtr=0;
for(i=1;i<=n;i++)
{
if(v[i]>med)
return 0;
if(sc+v[i]<=med)
sc=sc+v[i];
else
{
nrtr++;
sc=v[i];
}
}
nrtr++;
return nrtr<=k;
}
int bsL(int st, int dr)
{
int med,last;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i,s=0;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
s=s+v[i];
}
val=bsL(1,s);
cout<<val<<'\n';
return 0;
}