#include <cstdio>
#include <vector>
using namespace std;
vector<int>v;
int k;
bool ok(int max_val){
    int i, sum = 0, nr_trans = 1;
    for(i=0; i<(int)v.size(); ++i){
        if(sum + v[i] <= max_val)
            sum += v[i];
        else{
            sum = v[i];
            nr_trans++;
        }
    }
    return nr_trans <= k;
}
int main()
{
    int i, n, x, st = 1, dr = 256000001, med, rez, sum=0, max=0;
    freopen("transport.in","r",stdin);
    freopen("transport.out","w", stdout);
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i){
        scanf("%d",&x);
        v.push_back(x);
        //if(x > max)
           // max = x;
        //sum += x;
    }
    //st = max;
    //dr = sum;
    while(st <= dr){
        med = (dr + st)/2;
        if(ok(med)){
            dr = med - 1;
            rez = med;
        }
        else
            st = med + 1;
    }
    printf("%d",rez);
    return 0;
}