Pagini recente » Cod sursa (job #2307410) | Cod sursa (job #3159959) | Cod sursa (job #469109) | Cod sursa (job #947018) | Cod sursa (job #3254306)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
short int v[16001];
int main()
{
int n,k,st = -1 ,dr = 0,mijl,sol,i,s,nrt;
cin >> n >> k;
for (i = 1 ; i <= n ; i++)
{
cin >> v[i];
if (v[i] > st)
{
st = v[i];
}
dr += v[i];
}
while (st <= dr)
{
mijl = (st + dr) / 2;
s = 0;
nrt = 1;
for (i = 1 ; i <= n ; i++)
{
if (s + v[i] <= mijl)
{
s += v[i];
}
else
{
nrt++;
s = v[i];
}
}
if (nrt > k)
{
st = mijl + 1;
}
else
{
sol = mijl;
dr = mijl - 1;
}
}
cout << sol;
return 0;
}