Pagini recente » Cod sursa (job #434101) | Cod sursa (job #2785073) | Cod sursa (job #2538392) | Cod sursa (job #443681) | Cod sursa (job #1068330)
# include <fstream>
# include <algorithm>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int i,n,k,a[16005],ci,cs,m,s,nr;
int main()
{
f>>n>>k;
for (i=1; i<=n; ++i)
{
f>>a[i];
ci=max(ci,a[i]);
}
cs=25000000;
while(ci<cs)
{
s=0; nr=1;
m=(cs+ci)/2;
for (int i=1; i<=n; ++i)
if (s+a[i]<=m) s+=a[i];
else s=a[i],++nr;
if (nr>k) ci=m+1;
else cs=m;
}
g<<ci<<"\n";
return 0;
}