Pagini recente » Cod sursa (job #256185) | Cod sursa (job #3255112) | Cod sursa (job #1727753) | Cod sursa (job #1476211) | Cod sursa (job #3291261)
#include <fstream>
using namespace std;
const int N = 16000;
const int CMAX = 256e6;
int v[N], n, k;
bool se_pot_transporta(int c)
{
int nr = 0, c_c = 0;
for (int i = 0; i < n; i++)
{
if (c_c < v[i])
{
nr++;
c_c = c;
}
if (c_c < v[i])
{
return false;
}
c_c -= v[i];
}
return (nr <= k);
}
int main()
{
ifstream in("transport.in");
ofstream out("transport.out");
in >> n >> k;
for (int i = 0; i < n; i++)
{
in >> v[i];
}
int st = 1, dr = CMAX, rez = dr + 1;
while (st <= dr)
{
int m = (st + dr) / 2;
if (se_pot_transporta(m))
{
rez = m;
dr = m - 1;
}
else
{
st = m + 1;
}
}
out << rez << "\n";
in.close();
out.close();
return 0;
}