Pascal之工种问题

 program Project2;
 Type
   ma=(A,B,C);
   wk=..;
   const
   x:array[ma,wk] of integer
     =((,,),(,,),(,,));
 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:=;
   for i:= to  do
    for j:= to  do
    if i<>j then
     begin
     k:=-i-j;
     s:=x[A,i]+x[B,j]+x[C,k];
      if s>m then
       begin
       m:=s;
       maxefficiency[]:=i;
       maxefficiency[]:=j;
       maxefficiency[]:=k;
       end;
       end;
       for i:= to  do
       writeln('工人':,chr(+i),'工种':,maxefficiency[i]);
       writeln('最大效益' :,m:);
       readln;
       end.