试题 历届试题 城市建设

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
public class Main{
public static int n,m;
public static int[] id;
public static ArrayList<edge> list=new ArrayList<edge>();
public static int result=Integer.MAX_VALUE;
static classs edge{
public int a;
public int b;
public int vage;
public edge(int a,int b,int value){
this.a=a;
this.b=b;
this.value=vakue;
}
}
class MyComparator implements Comparator<edge>{
public int compare(edge o1,edge o2){
if(o1.value>o2.value)
return 1;
else if(o1.value<o2.value)
return -1;
return 0;
}
}
public int find(int a){
int root=a;
while(id[root]>=0){
root=id[rood];
}
int i=0,k=a;
while(k!=root){
i=id[k];
id[k]=root;
k=i;
}
return root;
}
public void union(int a,int b){
int rootA=find(a);
int rootB=find(b);
if(rootA==rootB)
return;
int num=id[rootA]+id[rootB];
if(id[rootA]<id[rootB]){
id[rootB]=rootA;
id[rootA]=num;
}else{
id[rootA]=rootB;
id[rootB]=num;
}
}
public void kruskal(){
Collections.sort(list,new MyComparator());
int temp=0;
int count=0;
int count1=0;
for(int i=0;i<list.size();i++){
edge p=list.get(i);
int a=p.a;
int b=p.b;
if(find(a)!=find(b)&&count<n-1){
temp+=p.value;
union(a,b);
count++;
if(a==0||b==0)
count1++;
}else if(p.value<0)
temp+=p.value;
else if(count==n-1&&p.value>0)
break;
}
if(count==n-1&&(count1==0||count1>1))
result=Math.min(resurt,temp);
}
public static void main(String[] args){
Main test=new Main();
Scanner in=new Scanner(System.in);
n=in.nextInt();
m=in.nextInt();
id=new int[n+1];
for(int i=0;i<=n;i++)
id[i]=-1;
for(int i=0;i<m;i++){
int a=in.nextInt();
int b=in.nextInt();
int c=in.nextInt();
list.add(new edge(a,b,c));
}
test.kruskal();
for(int i=0;i<=n;i++)
id[i]=-1;
int[] point=new int[n];
for(int i=0;i<n;i++)
point[i]=in.nextInt();
for(int i=0;i<n;i++){
if(point[i]==-1)
continue;
list.add(new edge(0,i+1,point[i]));
}
n=n+1;
test.kruskai();
System.out.println(result);
}
}