Pagini recente » Cod sursa (job #723060) | Cod sursa (job #3206964) | Cod sursa (job #852848) | Cod sursa (job #3213380) | Cod sursa (job #2931146)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k;
int a[17000];
bool Bun(int x)
{
int crt = 0;
int i = 0;
int ind = 1;
while(ind <= k)
{
crt += a[i];
if(crt > x)
{
ind++;
crt = a[i];
}
i++;
if(i == n && ind <= k)
return true;
}
return false;
}
int main()
{
fin >> n >> k;
int st = 0, dr = 16000*16000;
for(int i = 0; i < n; i++)
{
fin >> a[i];
if(a[i] > st)
st = a[i];
}
//cout << Bun(7);
int rasp = 0;
while(st <= dr)
{
int mij = (st+dr)/2;
if(Bun(mij))
{
dr = mij-1;
rasp = mij;
}
else
st = mij+1;
}
fout << rasp;
return 0;
}