Pagini recente » Cod sursa (job #539496) | Cod sursa (job #650248) | Cod sursa (job #2985862) | Cod sursa (job #742896) | Cod sursa (job #2850384)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int nmax=16000;
int n,k;
int v[nmax+5];
bool ok(int c)
{
int s,i,tr;
tr=s=0;
for(i=1;i<=n;i++)
{
if(v[i]>c)
return 0;
s=s+v[i];
if(s>c)
{
tr++;
s=v[i];
}
}
if(s<=c)
tr++;
return tr<=k;
}
int bs(int st,int dr)
{
int last=-1,med;
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,vmax=0;
fin>>n>>k;
for(i=1;i<=n;++i)
{
fin>>v[i];
vmax=vmax+v[i];
}
fout<<bs(1,vmax);
fin.close();
fout.close();
return 0;
}