Pagini recente » Cod sursa (job #977442) | Cod sursa (job #241957) | Cod sursa (job #968077) | Cod sursa (job #2401051) | Cod sursa (job #3177032)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, v[16001], c, mx, s;
int ok(int x)
{
int l=1, s1=0;
for(int i=0; i<n; i++)
{
if(s1+v[i] <= x) s1+=v[i];
else
{
l++;
s1=v[i];
}
}
return l <= k;
}
int main()
{
int st, dr;
fin>>n>>k;
for(int i=0; i<n; i++){
fin>>v[i];
if(v[i]>mx) mx=v[i];
s+=v[i];
}
st=mx;
dr=s;
while(st<=dr)
{
int m = (st + dr) / 2;
if(ok(m)) {c=m; dr=m-1;}
else st = m+1;
}
fout << c;
return 0;
}