#include<fstream.h>
ifstream f("transport.in");
ofstream g("transport.out");
long i,n,min,max,cap,gas,nr,s,k,p,a[16001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
if(a[i]>min)
min=a[i];
max+=a[i];
}
s=s;
while(max-min>1)
{
cap=(min+max)/2;
nr=1;
s=0;
p=0;
for(i=1;i<=n;i++)
if(s+a[i]>cap)
{
nr++;
s=a[i];
}
else
s+=a[i];
if(nr>k)
min=cap;
else
max=cap;
}
g<<cap;
f.close();
g.close();
return 0;
}