Pagini recente » Cod sursa (job #2947120) | Cod sursa (job #1789723) | Cod sursa (job #3152672) | Cod sursa (job #2502816) | Cod sursa (job #3257726)
#include <fstream>
#define int long long
using namespace std;
ifstream fcin("transport.in");
ofstream fout("transport.out");
int n,k,v[20001],sol;
inline int f(int val)
{
int nr=0;
int s=0;
for(int i=1; i<=n; i++)
{
if(s+v[i]>val)
s=0, nr++;
s=s+v[i];
}
if(s>0)
nr++;
if(nr<=k)
return 1;
return 0;
}
signed main()
{
fcin>>n>>k;
for(int i=1; i<=n; i++)
{
fcin>>v[i];
}
int st=1;
int dr=(1<<30);
while(st<=dr)
{
int mij=(st+dr)/2;
if(f(mij)==1)
{
sol=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
fout<<sol;
return 0;
}