C++ :

#include <bits/stdc++.h>
using namespace std;

int n,m,a[110];
int main(){
	int i,j,x,min;
	cin>>n>>m;
	for(i = 1;i <= n;i++){
		cin>>x;
		min = 1;
		//m个水龙头找最小值存入
		for(j = 2;j <= m;j++){
			if(a[j] < a[min]){
				min = j;
			}
		} 
		
		a[min] += x;
	}
	
	//找最大值
	int max = a[1];
	for(i = 2;i <= m;i++){
		if(a[i] > max){
			max = a[i];
		}
	}	
	cout<<max<<endl; 
}

Python :

sr=input().split()
n=int(sr[0])
m=int(sr[1])
a=[]
s=[0 for i in range(m)]
sr=input().split()
for i in range(n):
    a.append(int(sr[i]))
for i in range(m):
    s[i]=a[i]
for i in range(m,n):
    xiao=0
    for j in range(1,m):
        if(s[j]<s[xiao]):
            xiao=j
    s[xiao]=s[xiao]+a[i]
da=0
for i in range(1,m):
    if(s[i]>s[da]):
        da=i
print(s[da])