#include<stdio.h>
int n,k,j,x[16010],mut;
long s,i,sf,in,m,lib;
int main ()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
i=0;
for(j=1;j<=n;j++)
{
   scanf("%d",&x[j]);
   s=s+x[j];
   if(i>x[j])
	 i=x[j];
}
in=0;
sf=n+1;
while(sf-in>1)
{
m=(i+s)/2;
mut=1;
lib=0;
 for(j=1;j<=n;j++)
 {
   if(lib+x[j]<=m)
	  lib=lib+x[j];
	else
	   {
	   mut++;
	   lib=x[j];
	   }
 }//for
if(mut<=k)
{
   sf=m;
  s=m-1;
}
else
   {
	in=m;
   i=m+1;
   }//else
}
printf("%ld\n",sf);
return 0;
}