Pascal之工种问题

program Project2;
Type
  ma=(A,B,C);
  wk=1..3;
  const
  x:array[ma,wk] of integer
    =((4,3,3),(2,4,3),(4,5,2));
var
  maxefficiency:array[wk] of wk;
  i,j,k:wk;
  s:integer;
  m:integer;

{$APPTYPE CONSOLE}
begin
  { TODO -oUser -cConsole Main : Insert code here }
  m:=0;
  for i:=1 to 3 do
   for j:=1 to 3 do
   if i<>j then
    begin
    k:=6-i-j;
    s:=x[A,i]+x[B,j]+x[C,k];
     if s>m then
      begin
      m:=s;
      maxefficiency[1]:=i;
      maxefficiency[2]:=j;
      maxefficiency[3]:=k;
      end;
      end;
      for i:=1 to 3 do
      writeln('工人':6,chr(64+i),'工种':6,maxefficiency[i]);
      writeln('最大效益' :12,m:4);
      readln;
      end.