Pagini recente » Cod sursa (job #333538) | Cod sursa (job #1627500) | Cod sursa (job #2318670) | Cod sursa (job #3004617) | Cod sursa (job #2949180)
#include <fstream>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n,k,v[16005];
int ok(int C)
{
int i,s,tr;
s=tr=0;
for(i=1;i<=n;i++)
{
if(v[i]>C)
return k+1;
if(s+v[i]<=C)
s=s+v[i];
else
{
tr++;
s=v[i];
}
}
if(s>0)
tr++;
return tr;
}
int bsL(int st,int dr)
{
int med,last=-1;
while(st<=dr)
{
med=(st+dr)>>1;
if(ok(med)<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i,s;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
s=s+v[i];
}
fout<<bsL(1,s);
return 0;
}