#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

int v[16005];

bool nigger(int n, int k, int c) {
    int cnt = 1;
    int s = 0;
    for(int i = 1; i <= n; i++) {
        if(v[i] > c) return false;
        if(s + v[i] > c) {
            cnt++;
            s = v[i]; 
        } else {
            s += v[i];
        }
    }
    return cnt <= k;
}

int main(){
    int n, k;
    fin >> n >> k;
    int vmax = 0;
    int sum = 0;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
        vmax = max(v[i], vmax);
        sum += v[i];
    }
    
    int st = vmax, dr = sum;
    int rez = dr;
    
    while(st <= dr){
        int m = (st + dr) / 2;
        if(nigger(n, k, m)){
            rez = m;
            dr = m - 1;
        }
        else{
            st = m + 1;
        } 
    }
    
    fout << rez;

    return 0;
}