Pagini recente » Cod sursa (job #1231698) | Cod sursa (job #956983) | Cod sursa (job #1105844) | Cod sursa (job #2078206) | Cod sursa (job #2083503)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16001], n, k;
bool sepoate(int c)
{
int cc=0, nr=0;
for(int i=1; i<=n; i++)
{
if(v[i]>c)
{
return false;
}
if(v[i]>cc)
{
nr++;
cc=c;
}
cc-=v[i];
}
return (nr<=k);
}
int main()
{
int i, r, pas;
in>>n>>k;
for(i=1; i<=n; i++)
in>>v[i];
r=0;
pas=1<<27;
while(pas!=0)
{
if(!sepoate(r+pas))
r+=pas;
pas/=2;
}
r++;
out<<r<<"\n";
return 0;
}