import java.util.Arrays;
import java.util.Scanner;
public class Main {
static class edge{
int start;
int end;
int value;
edge(int start, int end, int value) {
super();
this.start = start;
this.end = end;
this.value = value;
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int p = sc.nextInt();
int[] maxt = new int[n];
Integer min = Integer.MAX_VALUE;
edge[] E = new edge[p];
for (int i = 0; i < n; i++) {
maxt[i] = sc.nextInt();
if(maxt[i] < min){
min = maxt[i];
}
}
for (int i = 0; i < p; i++) {
int a = sc.nextInt();
int b = sc.nextInt();
int value = sc.nextInt() * 2 + maxt[a - 1] + maxt[b - 1];
E[i] = new edge(a, b, value);
}
printMin(E, n, min);
}
private static void printMin(edge[] e,int n,int min){
int[] tip = new int[n];
for (int i = 0; i < n; i++) {
tip[i] = i;
}
sert(e);
int sum = 0;
for (int i = 0; i < n; i++) {
int start = e[i].start;
int end = e[i].end;
int value = e[i].value;
int t1 = tip[start-1];
int t2 = tip[end-1];
if(t1 != t2){
sum += value;
for (int j = 0; j < n; j++) {
if(tip[j] == t2){
tip[j] = t1;
}
}
}
}
System.out.println(sum+min);
}
//归并排序
private static void sert(edge[] e){
if(e.length > 1){
edge[] left = getHalfEdge(e, 0);
edge[] right = getHalfEdge(e, 1);
mergeEdgeArray(e, left, right);
sert(left);
sert(right);
mergeEdgeArray(e, left, right);
}
}
/**
* 获取集合中一半的数据
* @param e 需要的数据集合
* @param n 标识要获取的数据 0 标识左半边 1 标识右半边
* @return 返回获取到的数据
*/
private static edge[] getHalfEdge(edge[] e,int n){
edge[] half = null;
if(n == 0){
half = new edge[e.length / 2];
for (int i = 0; i < e.length / 2; i++) {
half[i] = e[i];
}
return half;
}else{
half = new edge[e.length - (e.length / 2)];
for (int i = 0; i < e.length - (e.length / 2); i++) {
half[i] = e[e.length / 2 + i];
}
return half;
}
}
/**
* 按照数据的大小合并数据
* @param e 合并之后的集合
* @param left 将要合并的集合
* @param right将要合并的集合
*/
private static void mergeEdgeArray(edge[] e,edge[] left,edge[] right){
int i = 0;
int j = 0;
int k = 0;
while(i<left.length && j<right.length){
if(left[i].value > right[j].value){
e[k] = right[j];
k++;
j++;
}else{
e[k++] = left[i++];
}
}
while(i < left.length) e[k++] = left[i++];
while(j < right.length) e[k++] = right[j++];
}
}
蓝桥杯 安慰奶牛(java)
最新推荐文章于 2020-03-20 17:22:08 发布