Pagini recente » Cod sursa (job #31308) | Cod sursa (job #1877212) | Cod sursa (job #2634894) | Cod sursa (job #1115918) | Cod sursa (job #1879044)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
int main()
{
int n,k,i,sumt=0;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
sumt+=v[i];
}
int st,dr,med,last=0,s=0,nr=0;
st=1; dr=sumt;
while(st<=dr)
{
med=(st+dr)/2;
nr=0;
s=0;
for(i=1;i<=n;i++)
{
if(v[i]>med)
{
nr=k+1;
break;
}
if(s+v[i]<=med)
{
s+=v[i];
}
else{
s=v[i];
nr++;
}
}
if(s<=med)
nr++;
if(nr>k)
{
st=med+1;
}
else{
dr=med-1;
last=med;
}
}
fout<<last;
return 0;
}