Pagini recente » Cod sursa (job #2406606) | Cod sursa (job #350634) | Cod sursa (job #985837) | Cod sursa (job #1319358) | Cod sursa (job #1879016)
#include <fstream>
using namespace std;
int const NMAX=16000;
int v[NMAX+5];
ifstream cin("transport.in");
ofstream cout("tansport.out");
int main()
{
int n, k, i, total=0, st, dr, med, last, tr,s;
cin>>n>>k;
for(i=1; i<=n; ++i)
{
cin>>v[i];
total+=v[i];
}
st=1;
dr=total;
last=0;
while(st<=dr)
{
med=(st+dr)/2;
tr=0;
s=0;
for(i=1; i<=n; ++i)
{
if(v[i]>med)
{
tr=k+1;
break;
}
if(s+v[i]<=med)
s=s+v[i];
else
{
tr++;
s=v[i];
}
}
if(s<=med)
tr++;
if(tr<=k)
{
last=med;
dr=med-1;
}
else
st=med+1;
}
cout<<last;
cin.close();
cout.close();
return 0;
}