Pagini recente » Cod sursa (job #1357990) | Cod sursa (job #3000945) | Cod sursa (job #1768221) | Cod sursa (job #11045) | Cod sursa (job #2426957)
#include <fstream>
using namespace std;
const int NMAX=16000;
int n,c[NMAX], k;
ifstream in("transport.in");
ofstream out("transport.out");
bool se_poate(int v)
{
int cc=0, nrt=0;
for (int i=0; i<n; i++)
{
if (c[i]>v)
{
return false;
}
if (c[i]>cc)
{
nrt++;
cc=v;
}
cc-=c[i];
}
return (nrt<=k);
}
int main()
{
in >> n >> k;
for (int i=0; i<n; i++)
{
in >> c[i];
}
int st=1, dr= NMAX*NMAX, m;
while (st<dr){
m=(st+dr)/2;
if (se_poate(m)){
dr=m;
}
else{
st=m+1;
}
}
out << st;
in.close();
out.close();
return 0;
return 0;
}