#include<stdio.h>
int n,k,max;
long suma;
int v[16010];

void read()
{
	freopen("transport.in","r",stdin);
	freopen("transport.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&v[i]);
		if(v[i]>max)
			max=v[i];
		suma=suma+v[i];
	}
}

int rez(long c)
{
	int i;
	long s=0,nr=0;
	for(i=1;i<=n;i++)
	{
		if(s+v[i]>c)
		{
			s=0;
			nr++;
		}
		s=s+v[i];
	}
	nr++;
	return nr<=k;
}

void cautare()
{
	long st=max,dr=suma,m;
	while(st!=dr)
	{
		m=(st+dr)>>1;
		if(rez(m))
			dr=m;
		else
			st=m+1;
	}
	printf("%ld\n",st);
}

int main()
{
	read();
	cautare();
	return 0;
}