mxdong1 2010-08-01 07:35:00
点我顶贴
收藏
删除
program lx;
var n,k,i,j,min,t,sum,sum1,x,y,s:longint;a:array[1..100,1..100]of longint;
c:array[1..100]of boolean;b:array[1..100]of longint;
begin
readln(n,k);
sum:=0;sum1:=0;
for i:=1 to n do
for j:=1 to n do
a[i,j]:=maxlongint;
for i:=1 to k do
begin
readln(x,y,s);
sum:=sum+s;
a[x,y]:=s;a[y,x]:=s;
end;
for i:=2 to n do
b[i]:=a[1,i];
fillchar(c,sizeof(c),false);
c[1]:=true;
for i:=1 to n-1 do
begin
min:=maxlongint;
for j:=2 to n do
if (min>b[j])and(not c[j]) then begin t:=j;min:=b[j];end;
sum1:=sum1+min;
c[t]:=true;
for j:=2 to n do
if a[t,j]<b[j] then b[j]:=a[t,j];
end;
writeln(sum-sum1);
end.