Pagini recente » Cod sursa (job #820190) | Cod sursa (job #2386540) | Istoria paginii runda/ffcxzczxczx/clasament | Cod sursa (job #2284553) | Cod sursa (job #2340856)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
long long n,act,nr;
long long k,i;
long long v[17000];
bool ok(int c)
{
int tr=0,i,sc=0;
for(i=1;i<=n;i++)
{
if(v[i]>c)return 0;
if(sc+v[i]<=c)
{
sc=sc+v[i];
}
else
{
tr++;
sc=v[i];
}
}
if(sc>0)tr++;
return tr<=k;
}
int bs(int st,int dr)
{
int med,last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int i,s=0,ans;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
s=s+v[i];
}
ans=bs(1,s);
fout<<ans<<'\n';
}