简单

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
int n, m, w[10005], time[105] = {}, mx = 0;
cin >> n >> m;
for(int i = 1; i <= n; ++i) cin >> w[i];

for(int i = 1; i <= n; ++i) {
    int mni = 1; // 找最早空闲的水龙头
    for(int j = 1; j <= m; ++j)
        if(time[j] < time[mni]) mni = j;
    time[mni] += w[i]; // 分配该同学到mni号水龙头
}

for(int i = 1; i <= m; ++i) 
    mx = max(mx, time[i]);
cout << mx;
return 0;

}