Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

const INF = 1 << 60

// Main
func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	N := sc.nextInt()
	G := make([][]int, N)
	for i := 0; i < N; i++ {
		G[i] = make([]int, N)
		for j := 0; j < N; j++ {
			G[i][j] = sc.nextInt()
		}
	}
	d := make([]int, N)
	for i := 0; i < N; i++ {
		d[i] = INF
	}
	seen := make([]bool, N)
	d[0] = 0
	ans := 0
	for {
		cur := 0
		minCost := INF
		for i := 0; i < N; i++ {
			if !seen[i] && d[i] < minCost {
				minCost = d[i]
				cur = i
			}
		}
		if minCost == INF {
			break
		}
		seen[cur] = true
		ans += d[cur]
		for i := 0; i < N; i++ {
			cost := G[cur][i]
			if cost != -1 && cost < d[i] {
				d[i] = cost
			}
		}
	}

	fmt.Fprintln(wtr, ans)
	wtr.Flush()
}

C++: #include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int G[n][n];
    int find[n];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            cin>>G[i][j];
        }
    }
    for(int i=0;i<n;i++){
        find[i]=-1;
    }
    find[0]=0;
    int end=0;
    int mind;
    int sum=0;
    while(true){
        int min=2001;
        for(int i=0;i<n;i++){
            if (find[i]!=-1){
                for(int j=0;j<n;j++){
                    if (G[i][j]!=-1&&G[i][j]<min){
                        if (find[j]==-1){
                            min=G[i][j];
                            mind=j;
                        }
                    }
                }
            }
        }
        find[mind]=mind;
        sum+=min;
        end+=1;
        if(end==n-1) break;
    }cout<<sum<<endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
ll dx[4] = { 0, 1, 0, -1 };
ll dy[4] = { 1, 0, -1, 0 };
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
static const int MAX = 100;
static const int WHITE = 0; // V-T
static const int BLACK = 1; // T

int n, M[MAX][MAX];

int prim()
{
    int u, minv;
    int d[MAX]; // d[u]: Tに属する頂点とV-Tに属するuから頂点を繋ぐ辺の中で重みが最小の辺の重みを記録
    int p[MAX]; // p[u]: MSTにおける頂点uの親を記録
    int color[MAX]; // 訪問状態を記録

    // initialize
    rep(i, n)
    {
        d[i] = INF;
        p[i] = -1;
        color[i] = WHITE;
    }
    d[0] = 0;

    while (1) {
        minv = INF;
        u = -1;
        rep(i, n)
        {
            // uは最小の経路がある かつ uへは未完了
            if (d[i] < minv && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }

        // 更新できる辺がないときに終了
        if (u == -1) {
            break;
        }

        color[u] = BLACK;
        rep(v, n)
        {
            // vは未完了 かつ u->vに道はある
            if (color[v] != BLACK && M[u][v] != INF) {
                // vへの経路を最小に更新
                if (M[u][v] < d[v]) {
                    d[v] = M[u][v];
                    p[v] = u;
                }
            }
        }
    }

    int sum = 0;
    rep(i, n)
    {
        if (p[i] != -1) {
            sum += M[i][p[i]];
        }
    }
    return sum;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    rep(i, n)
    {
        rep(j, n)
        {
            int e;
            cin >> e;
            M[i][j] = (e == -1) ? INF : e;
        }
    }

    cout << prim() << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
 
#define INF (1<<29)
 
int G[100][100], n;
 
int prim(){
  int p[100], d[100], c[100];
  int u;
 
  for(int i = 0; i < n; i++){
    d[i] = INF;
    p[i] = -1;
    c[i] = 0;
  }
 
  d[0] = 0;
 
  while(1){
    int minv = INF;
    u = -1;
    for(int i = 0; i < n; i++){
      if(minv > d[i] && c[i] != 2){
        u = i;
        // cout << u << endl;
        minv = d[i];
      }
    }
 
    if(u == -1) break;
    c[u] = 2;
    for(int v = 0; v < n; v++){
      if(c[v] != 2 && G[u][v] != INF){
        if(d[v] > G[u][v]){
          d[v] = G[u][v];
          p[v] = u;
          c[v] = 1;
        }
      }
    }
  }
 
  int sum = 0;
  for(int i = 0; i < n; i++){
    if(p[i] != -1) sum+=G[i][p[i]];
    // cout << p[i] << endl;
  }
  return sum;
}
 
 
  int main(){
 
    cin >> n;
    for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++){
        int v;
        cin >> v;
        G[i][j] = v;
        if(v == -1) G[i][j] = INF;
      }
      // cout << endl;
    }
 
    cout << prim() << endl;
 
  }

C++: #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
bool vis[107];
struct edge {
	int u, v, w;
	edge(int u, int v, int w) :u(u), v(v), w(w) {}
	bool operator < (const edge &rhs) const {
		return w < rhs.w;
	}
};
vector<edge> e;
int main() {
    int n, ans = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
    	for (int j = 0; j < n; j++) {
    		int tmp;
    		scanf("%d", &tmp);
    		if (tmp >= 0 && i >= j) e.push_back(edge(i, j, tmp));
		}
	}
	sort(e.begin(), e.end());
	vis[e[0].u] = true;
	bool flag = true;
	int cnt = e.size();
	while (flag) {
		flag = false;
		for (int i = 0; i < cnt; i++) {
			if (vis[e[i].u] != vis[e[i].v]) {
				vis[e[i].u] = true;
				vis[e[i].v] = true;
				ans += e[i].w;
				flag = true;
				break;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

C++: #include <iostream>
#include <vector>
#define INF 1<<30
#define WHITE 0
#define GRAY 1
#define BLACK 2
int G[2001][2001];
using namespace std;
int n;

void prim(int *d, int *pi){
    int color[n];
    int u = 0;
    for (int i = 0; i < n; i++){
        d[i] = pi[i] = INF;
        color[i] = WHITE;
    }
    d[0] = 0;
    while (1){
        int mincost = INF;
        for (int i = 0; i < n; i++){
            if (color[i] != BLACK && d[i] < mincost){
                mincost = d[i];
                u = i;
            }
        }
        if (mincost == INF) break;
        color[u] = BLACK;
        for (int v = 0; v < n; v++){
            int w = G[u][v];
            if (w == -1) continue;
            else if (color[v] != BLACK && w < d[v]){
                pi[v] = u;
                d[v] = w;
            }
        }
    }
}

int main(int argc, char* argv[]) {
    cin >> n;
    int d[n], pi[n], sum = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            cin >> G[i][j];
        }
    }
    prim(d, pi);
    for (int i = 0; i < n; i++) sum += d[i];
    cout << sum << endl;
    return 0;
}