Pagini recente » Cod sursa (job #2543184) | Cod sursa (job #652826) | Cod sursa (job #1589032) | Cod sursa (job #2268616) | Cod sursa (job #2929729)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
const int Nmax = 16005;
int v[Nmax];
int n, k;
int ver(int c)
{
int s, trans, i;
s = 0;
trans = 1;
for(i = 1; i <= n; i++)
{
s += v[i];
if(s > c)
s = v[i], trans++;
}
return trans;
}
int main()
{
int i;
fin >> n >> k;
for(i = 1; i <= n; i++)
fin >> v[i];
int st = 0, dr = 256000000, sol;
while(st < dr)
{
int mij = (st + dr) / 2;
if(ver(mij) <= k)
dr = mij - 1, sol = mij;
else
st = mij + 1;
}
fout << sol;
return 0;
}