Go: package main

import (
	"fmt"
	"sort"
)

type Edge struct {
	I int
	J int
	A int
}

func main() {
	var n int
	fmt.Scan(&n)

	g := make([][]int, n)
	edges := make([]Edge, 0, n*(n-1)/2)
	parents := make([]int, n)
	for i := 0; i < n; i++ {
		g[i] = make([]int, n)
		for j := 0; j < n; j++ {
			fmt.Scan(&g[i][j])
			if g[i][j] > 0 {
				edges = append(edges, Edge{i, j, g[i][j]})
			}
		}
		parents[i] = i
	}
	sort.SliceStable(edges, func(i, j int) bool { return edges[i].A > edges[j].A })

	sum := 0
	for len(edges) > 0 {
		edge := edges[len(edges)-1]
		edges = edges[:len(edges)-1]

		if same(edge.I, edge.J, &parents) {
			continue
		}
		union(edge.I, edge.J, &parents)
		sum += edge.A
	}
	fmt.Println(sum)
}



func root(id int, parents *[]int) int {
	if id == (*parents)[id] {
		return id
	}
	return root((*parents)[id], parents)
}

func union(i, j int, parents *[]int) {
	(*parents)[root(j, parents)] = (*parents)[root(i, parents)]
}

func same(i, j int, parents *[]int) bool {
	return root(i, parents) == root(j, parents)
}

C++: #include <iostream>
using namespace std;
 
int n;
int a[101][101];
int flg[101];
int t[101];
int sum = 0;
 
void visit(){
  int ima = 0;
  int mine = 100000000;
   
   
  for(int k=0;k<n-1;k++) {
    mine = 10000000;
    for(int i=0;i<n;i++) {
      if(flg[i] == 0 && mine > t[i]) {
    mine = t[i];
    ima = i;
      }
    }
    sum += mine;
    flg[ima] = 1;
     
    for(int i=0;i<n;i++) 
      if(a[ima][i] != -1) 
    if(t[i] > a[ima][i] ) t[i] = a[ima][i];
     
     
  }
}
 
int main() {
 
  cin >> n;
 
  for(int i=0;i<n;i++) 
    for(int j=0;j<n;j++) 
      cin >> a[i][j];
   
  for(int i=0;i<n;i++) {
    flg[i] = 0;
    t[i] = 100000000;
  }
   
  t[0] = 0;
  flg[0] = 1;
  for(int i=0;i<n;i++) 
    if(a[0][i] != -1) t[i] = a[0][i];
 
  visit();
 
  cout << sum << endl;
  
  return 0; 
   
}

C++: #include<iostream>
#include<string>
using namespace std;

int prim();
int Infty = 20000000;

int n,*d,*p,**G;
string *color;

int main(){
	cin>>n;
	d = new int[n]; p = new int[n];
	d = d-1; p = p-1;
	G = new int*[n]; for(int i=0;i<n;i++) G[i] = new int[n];
	G = G-1; for(int i=1;i<=n;i++) G[i] = G[i]-1;
	color = new string[n]; color = color-1;

	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++) cin>>G[i][j];
	}

	cout<<prim()<<endl;

	delete [] (d+1); delete [] (p+1);
	for(int i=1;i<=n;i++) delete [] (G[i]+1); delete [] (G+1);
	delete [] (color+1);
}

int prim(){
	for(int i=1;i<=n;i++){
		color[i] = "WHITE"; d[i] = Infty;
	}
	d[1] = 0; p[1] = -1;

	while(1){
		int u , mincost = Infty;
		for(int i=1;i<=n;i++){
			if(color[i]!="BLACK"&&d[i]<mincost){
				mincost = d[i];
				u = i;
			}
		}

		if(mincost==Infty) break;

		color[u] = "BLACK";

		for(int v=1;v<=n;v++){
			if(color[v]!="BLACK" && G[u][v]!=-1){
				if(G[u][v]<d[v]){
					d[v] = G[u][v];
					p[v] = u;
					color[v] = "GRAY";
				}
			}
		}
	}

	int sum = 0;
	for(int i=1;i<=n;i++){
		sum += d[i];
	}
	return sum;
}

C++: #include <iostream>
using namespace std;
static const int MAX = 100;
static const int INF = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

int prim() {
  int u, minv;
  // d: TとT-Vをつなぐ重みが最小の辺の重み
  // p: p[v]に頂点vの親
  int d[MAX], p[MAX], color[MAX];

  for (int i = 0; i < n; i++) {
    d[i] = INF;
    p[i] = -1;
    color[i] = WHITE;
  }

  d[0] = 0;

  while (1) {
    minv = INF;
    u = -1;
    for (int i = 0; i < n; i++) {
      if (minv > d[i] && color[i] != BLACK) {
        u = i;
        minv = d[i];
      }
    }
    if (u == -1) break;
    color[u] = BLACK;
    for (int v = 0; v < n; v++) {
      if (color[v] != BLACK && M[u][v] != INF) {
        if (d[v] > M[u][v]) {
          d[v] = M[u][v];
          p[v] = u;
          color[v] = GRAY;
        }
      }
    }
  }
  int sum = 0;
  for (int i = 0; i < n; i++) {
    if (p[i] != -1) sum += M[i][p[i]];
  }

  return sum;
}

int main() {
  cin >> n;

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int e;
      cin >> e;
      M[i][j] = (e == -1) ? INF : e;
    }
  }

  cout << prim() << endl;
}

C++: #include <iostream>
using namespace std;
#define N 100
#define INF 9999999
int M[N][N];
int mincost[N];
bool used[N];
int n;
int prim(){
  for(int i=0;i<n;i++){
    used[i]=false;
    mincost[i]=INF;
  }
  mincost[0]=0;
  int res=0;

  while(true){
    int v=-1;
    for(int i=0;i<n;i++){
      if(!used[i] && (v==-1||mincost[i]<mincost[v])){
        v=i;
      }
    }
    if(v==-1) break;
    used[v]=true;
    res+=mincost[v];

    for(int i=0;i<n;i++){
      mincost[i]=min(mincost[i], M[v][i]);
    }
  }
  return res;
}
int main(){
  cin>>n;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      int e; cin>>e;
      M[i][j]=(e==-1)?INF:e;
    }
  }
  cout<<prim()<<"\n";

}