C++ :

#include<iostream>
using namespace std;
int T[200];
int main()
{
	int n,m,t;
	cin >> n >> m;
	for(int i=0; i<n; ++i)
	{
		cin >> t;
		int min_index = 0;
		for(int j=1; j<m; ++j)
		{
			if(T[j] < T[min_index])
				min_index = j;
		}
		T[min_index] += t;
	}
	int max_index = 0;
	for(int i=1; i<m; ++i)
	{
		if(T[i] > T[max_index])
			max_index = i;
	}
	cout << T[max_index] << endl;
	return 0;
}

Pascal :

var a:array[1..11000] of integer;
    b:array[1..100] of integer;
    i,j,n,m,next,sum:longint;
function check:boolean;
var i:integer;
begin
  for i:=1 to m do if a[b[i]]>0 then exit(true);
  check:=false;
end;
begin
  readln(n,m);
  for i:=1 to n do read(a[i]);
  for i:=1 to m do b[i]:=i;
  next:=m+1;
  repeat
    for i:=1 to m do
    begin
      dec(a[b[i]]);
      if a[b[i]]=0 then
      begin
        b[i]:=next;
        inc(next);
      end;
    end;
    inc(sum);
  until not check;
  writeln(sum);
end.