1 #include <cstdio>
 2 #include <cmath>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <iostream>
 6 #include <cstring>
 7 #include <cmath>
 8 #include <queue>
 9 using namespace std;
10 priority_queue<int, vector<int>, greater<int> > a;
11 int main()
12 {
13     freopen("death.in","r",stdin);
14     freopen("death.out","w",stdout);
15     int n,i,t,ok=0,x=0,k;
16     scanf("%d%d",&n,&k);
17     for(int i=1;i<=k;i++)
18       a.push(0);
19     for(i=0; i<n; i++)    
20     {
21         scanf("%d",&t);
22         int now=a.top();
23         a.pop();
24         now+=t;
25         a.push(now);
26     }
27     /*int maxx=0;
28     while(!a.empty())
29     {
30         maxx=a.top();
31         a.pop();
32     }    */
33     cout<<a.top()<<endl;
34     fclose(stdin);
35     fclose(stdout);
36     return 0;
37 }