#include <bits/stdc++.h>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
const int NMAX = 16000;
int v[NMAX], n, k;

int isPossible(int c){
    int sum = 0, nr = 1;
    for(int i = 0 ; i < n ; i ++){
        if(sum + v[i] > c){
            sum = 0;
            nr++;
        }
        sum += v[i];
    }
    return nr;
}

int main() {
    in >> n  >>k;
    for(int i = 0 ; i < n ; i ++){
        in >> v[i];
    }

    int max = max_element(v, v + n)[0];

    while(isPossible(max) > k){
        max++;
    }

    out << max;
}