Pagini recente » Cod sursa (job #2647269) | Cod sursa (job #472396) | Cod sursa (job #871710) | Cod sursa (job #524680) | Cod sursa (job #2985038)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k;
vector<int>v;
bool Bun(int x)
{
int crt = 0;
int drum = 1;
for(int i = 0; i < n; i++)
{
if(v[i] > x)
return false;
crt += v[i];
if(crt > x)
{
drum++;
crt = v[i];
}
if(drum > k)
return false;
}
return true;
}
int main()
{
fin >> n >> k;
for(int i = 0; i < n; i++)
{
int x;
fin >> x;
v.push_back(x);
}
int st = 1, dr = 16000*16000, rasp = 0;
//cout << Bun(8);
while(st <= dr)
{
int mij = (st+dr)/2;
if(Bun(mij))
{
rasp = mij;
dr = mij-1;
}
else
st = mij+1;
}
fout << rasp;
return 0;
}