Go: package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"strconv"
)

type Node struct {
	id     int
	weight int
}

func init() {
	sc.Split(bufio.ScanWords)
}

type NodeHeap []Node

func (h NodeHeap) Len() int           { return len(h) }
func (h NodeHeap) Less(i, j int) bool { return h[i].weight < h[j].weight }
func (h NodeHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *NodeHeap) Push(x interface{}) {
	*h = append(*h, x.(Node))
}

func (h *NodeHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func main() {
	n := scanInt()

	list := make([][]int, n)
	seen := make([]bool, n)
	for i := range list {
		list[i] = make([]int, n)
		for j := range list[i] {
			list[i][j] = scanInt()
		}
	}

	start := Node{id: 0, weight: 0}
	h := &NodeHeap{start}
	heap.Init(h)

	sum := 0
	for h.Len() > 0 {
		node := heap.Pop(h).(Node)
		if seen[node.id] {
			continue
		}
		seen[node.id] = true
		sum += node.weight

		for i, w := range list[node.id] {
			if w < 0 {
				continue
			}
			heap.Push(h, Node{id: i, weight: w})
		}
	}

	fmt.Println(sum)
}

C++: #include <stdio.h>
#define rep(i, n) for(int i = 0; i < n; ++i)

int main(void) {
  int n, i, j, ans = 0;
  scanf("%d", &n);
  int a[n][n];
  char f[n];
  rep(i, n) rep(j, n) scanf("%d", &a[i][j]);
  rep(i, n) f[i] = 0;
  f[0] = 1;
  rep(i, n - 1) {
    int min = 10000, minx, miny;
    rep(j, n) {
      rep(k, n) {
        if(f[j] && !f[k] && a[j][k] => 0 && a[j][k] < min) min = a[j][k], minx = j, miny = k;
      }
    }
    ans += min;
    f[miny] = 1;
  }
  printf("%d\n", ans);
  return 0;
}

C++: #include<iostream>

using namespace std;

int n, M[100][100], W = 0, G = 1, B = 2;

int prim () {

    int u, minv, i, v, d[100], p[100], color[100], sum;

    for (i = 0; i < n; i++) {
        d[i] = (1 << 21);
        p[i] = -1;
        color[i] = W;
    }

    d[0] = 0;

    while (1) {

        minv = (1 << 21);
        u = -1;
        for (i = 0; i < n; i++) {
            if (minv > d[i] && color[i] != B) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1) {
            break;
        }
        color[u] = B;
        for (v = 0; v < n; v++) {
            if (color[v] != B && M[u][v] != (1 << 21)) {
                if (d[v] > M[u][v]) {
                    d[v] = M[u][v];
                    p[v] = u;
                    color[v] = G;
                }
            }
        }

    }

    sum = 0;
    for (i = 0; i < n; i++) {
        if (p[i] != -1) {
            sum += M[i][p[i]];
    }

    return sum;

}

int main () {

    int i, j, e;

    cin >> n;

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

    cout << prim () << endl;

    return 0;

}

C++: #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#include <bits/stdc++.h>
using namespace std;

#define WHITE 0
#define GRAY 1
#define BLACK 2
#define INF 1000000010

  int n;
  int M[100][100];
  int color[100];
  int d[100];
  int p[100];
  int mincost;

void prim(){
  rep(u,n) color[u]=WHITE;
  rep(u,n) d[u]=INF;
  d[0]=0;
  p[0]=-1;
  
  int u;
  while(1){
    mincost=INF; 
    rep(i,n){
      if(color[i] != BLACK && d[i]<mincost){
        mincost=d[i];
        u=i;
      }
    }
    
    if(mincost==INF) break;
    
    color[u]=BLACK;
    
    rep(v,n){
      if(color[v] != BLACK && M[u][v] != -1){
        if(M[u][v]<d[v]){
          d[v]=M[u][v];
          p[v]=u;
          color[v]=GRAY;
        }
      }
    }
  }
}

int main(){
  cin>>n;
  
  rep(i,n){
    rep(j,n) cin>>M[i][j];
  }
  
  prim();
  int sum=0;
  rep(i,n) sum+=d[i];
  
  cout<<sum<<endl;
  
  return 0;
}

C++: #include<iostream>

using namespace std;

int n, M[100][100], W = 0, G = 1, B = 2;

int prim () {

    int u, minv, i, v, d[100], p[100], color[100], sum;

    for (i = 0; i < n; i++) {
        d[i] = (1 << 21);
        p[i] = -1;
        color[i] = W;
    }

    d[0] = 0;

    while (1) {

        minv = (1 << 21);
        u = -1;
        for (i = 0; i < n; i++) {
            if (minv > d[i] && color[i] != B) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1) {
            break;
        }
        color[u] = B;
        for (v = 0; v < n; v++) {
            if (color[v] != B && M[u][v] != (1 << 21)) {
                if (d[v] > M[u][v]) {
                    d[v] = M[u][v];
                    p[v] = u;
                    color[v] = G;
                }
            }
        }

    }

    sum = 0;
    for (i = 0; i < n; i++) {
        if (p[i] != -1) {
            sum += M[i][p[i]];
        }
    }

    return sum;

}

int main () {

    int i, j, e;

    cin >> n;

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

    cout << prim () << endl;

    return 0;

}

C++: #include<bits/stdc++.h>
using namespace std;

#define INF 100000000

//訪問状態
#define White 0
#define Gray 1
#define Black 2

//Treeの状態を表した隣接行列
int Tree[100][100];
int sum = 0;

int prim(int n){
  int u, minv;
  //d = 見て来たノードの中から出る最小の辺を記録
  //p = MSTにおける頂点の親を記録
  int d[100], p[100], color[100];

  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 && Tree[u][v] != INF){
	if(d[v] > Tree[u][v]){
	  d[v] = Tree[u][v];
	  p[v] = u;
	  color[v] = Gray;
	}
      }
    }
  }

  for(int i = 0 ; i < n ; i++){
    if(p[i] != -1) sum += Tree[i][p[i]];
  }

  return sum;

}

int main(){
  int n, status;

  cin >> n;

  for(int i = 0 ; i < n ; i++){
    for(int j = 0 ; j < n ; j++){
      cin >> status;

      if(status == -1){
	Tree[i][j] = INF;
      }else{
	Tree[i][j] = status;
      }
    }
  }

  cout << prim(n) << endl;

  return 0;
}