#include <iostream>
#include <fstream>

using namespace std;

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

int n, k, a[16000 + 10];
int maxi = 0;

void read() {
    fin >> n >> k;

    for(int i = 1; i <= n; i++) {
        fin >> a[i];
        if(a[i] > maxi) {
            maxi = a[i];
        }
    }
}


int este(int cap) {
    int drum = 1;
    int cap1 = a[1];
    for(int i = 2; i <= n; i++) {
        if(cap1 + a[i] <= cap) {
            cap1 = cap1 + a[i];
        } else {
            cap1 = a[i];
            drum++;
        }
    }
    return drum;
}

int searc() {
    int st = maxi, dr = 16000 * 16000 + 10;
    while(st < dr) {
        int mid = st + (dr - st) / 2;
        if(este(mid) <= k) {
            dr = mid;
        } else {
            st = mid + 1;
        }
    }
    return st;
}

int main() {
    read();
    fout << searc();
    fin.close();
    fout.close();
    return 0;
}