#include <fstream>

using namespace std;

ifstream cin("transport.in");
ofstream cout("transport.out");

const int N = 16000;
int v[N];

int verif(int v[], int volcamion, int n){
    int cnt = 1, s = 0;
    for(int i = 0; i < n; i++){
        s += v[i];
        if(s > volcamion){
            s = v[i];
            cnt++;
        }
    }
    return cnt;
}
int caut(int st, int dr, int k, int n){
    int sol;
    while(st <= dr){
        int mij = (st + dr) / 2;
        if(verif(v, mij, n) <= k){
            dr = mij - 1;
            sol = mij;
        }
        else
            st = mij + 1;
    }
    return sol;
}

int main()
{
    int n, k, s = 0, maxim =  -1;
    cin >> n >> k;
    for(int i = 0; i < n; i++){
        cin >> v[i];
        s += v[i];
        maxim = max(maxim, v[i]);
    }
    cout << caut(maxim, s, k, n);
    return 0;
}