求各位神犇帮我看看orz
type node=record
x,y,v:longint;
end;
var m,n,l:longint;
g:array[1..1000] of node;
father:array[1..1000] of longint;
max,cnt:longint;

procedure init;
var i:longint;
begin
read(n,m,l);
for i:=1 to m do
father[i]:=i;
for i:=1 to m do
read(g[i].x,g[i].y,g[i].v);
end;

procedure sort(l,r: longint);
var
i,j,x: longint;
y:node;
begin
i:=l;
j:=r;
x:=g[random(r-l+1)+l].v;
repeat
while g[i].v<x do
inc(i);
while x<g[j].v do
dec(j);
if not(i>j) then
begin
y:=g[i];
g[i]:=g[j];
g[j]:=y;
inc(i);
j:=j-1;
end;
until i>j;
if l<j then
sort(l,j);
if i<r then
sort(i,r);
end;

function getfather(v:longint):longint;
begin
if father[v]=v then exit(v)
else father[v]:=getfather(father[v]);
exit(father[v]);
end;

function union(x,y:longint):boolean;
var fx,fy:longint;
begin
fx:=getfather(father[x]);
fy:=getfather(father[y]);
father[fx]:=fy;
end;

procedure kruscal;
var ans,i:longint;
begin
cnt:=0;ans:=0;
for i:=1 to m do
if getfather(g[i].x) <> getfather(g[i].y) then
begin
union(g[i].x,g[i].y);
max:=max+g[i].v;
inc(cnt);
if cnt=n-l then break;
end;

end;

begin
randomize;
max:=0;
init;
sort(1,m);
kruscal;
if cnt=n-l then write(max)
else write('No Answer');
end.