此处为Pascal代码
var
  n,i,j,min,k,x,y,ans:longint;
  b:array[0..1000] of longint;
  a:array[0..1000,0..1000] of longint;
begin
  readln(n);
  fillchar(b,sizeof(b),0);
  for i:=1 to n do
  for j:=1 to n do
  read(a[i,j]);
  ans:=0;
  b[1]:=1;
  for i:=1 to n-1 do
  begin
    min:=maxlongint;
    for j:=1 to n do
    for k:=j+1 to n do
    if (b[j]+b[k]=1)and(min>a[j,k]) then begin x:=j;y:=k;min:=a[j,k];end;
    ans:=ans+a[x,y];
    b[x]:=1;
    b[y]:=1;
  end;
  writeln(ans);
end.
prim算法最小生成树，为什么答案错误