#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[160001];
bool nigger(int n, int k, int c){
	int cnt = 0, s = 0;
	for(int i = 1; i <= n; i++){
		if(s + v[i] > c){
			cnt ++;
			s = 0;
		}
		else{
			s += v[i];
		}
	}
	if(cnt <= k)
		return true;
	else 
		return false;
}
int main(){
	int n, k;
	fin >> n >> k;
	int vmax = 0;
	for(int  i = 1; i <= n; i++){
		fin >> v[i];
		vmax = max(v[i], vmax);
	}
	int st = vmax, dr = 256000001;
	while(st < dr){
		int m = (st + dr) / 2;
		if(nigger(n, k, m) == true){
			dr = m;
		}
		else{
			st = m + 1;
		} 
	}
	fout << st + 1;



	return 0;
}