Go: package main

import (
	"fmt"
	"container/heap"
)

type Node struct {
	Id int
	Dis int
}

type PriorityQueue []*Node

func (pq PriorityQueue) Len() int { return len(pq) }

func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].Dis < pq[j].Dis
}

func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PriorityQueue) Push(x interface{}) {
	*pq = append(*pq, x.(*Node))
}

func (pq *PriorityQueue) Pop() interface{} {
	n := len(*pq)
	pop := (*pq)[n-1]
	*pq = (*pq)[0:n-1]
	return pop
}

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

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		var u,k int
		fmt.Scan(&u)
		fmt.Scan(&k)
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Scan(&g[u][j])
			fmt.Scan(&c[u][j])
		}

		if u == 0 {
			d[u] = 0
		} else {
			d[u] = 1 << 30
		}
		pq.Push(&Node{u, d[u]})
	}
	heap.Init(&pq)

	for pq.Len() > 0 {
		node := heap.Pop(&pq).(*Node)
		for i := 0; i < len(g[node.Id]); i++ {
			nextId := g[node.Id][i]
			nextDis := node.Dis + c[node.Id][i]
			if nextDis < d[nextId] {
				d[nextId] = nextDis
				heap.Push(&pq, &Node{nextId, nextDis})
			}
		}
	}

	for i := 0; i < n; i++ {
		fmt.Println(i, d[i])
	}
}

C++: #include"iostream"
#include"algorithm"
#include"cstdio"
#include"cstring"
#include"string"
#include"vector"
#include"queue"
#include"map"
#include"set"
#include"stack"
#include"cmath"
using namespace std;
#define INF 0xfffffff
#define maxn 10002
struct Node
{
    int e;
    int w;
    friend bool operator < (Node A, Node B)
    {
        return  A.w > B.w;
    }
};
bool vis[maxn];
int m, n;
vector< vector<Node> > G;
int Dij(int S,int E)
{
    Node P, Pn;
    P.e = S;
    P.w = 0;
	priority_queue<Node> Q;
	Q.push(P);
	while( !Q.empty() )
    {
        P = Q.top();
        Q.pop();
		if( vis[P.e] )
            continue;
		vis[P.e] = true;
		if( P.e == E )
            return P.w;
		int len = G[P.e].size();
		for(int i=0; i< len; i++)
        {
            Pn.e = G[P.e][i].e;
            Pn.w = G[P.e][i].w + P.w;
			if( !vis[Pn.e] )
                Q.push(Pn);
        }
    }
    return -1;
}
int main()
{
		Node P;
		cin >> m;
        G.resize(10000+1);
		for(int i=0; i<m; i++)
        {
			int k;
			memset(vis,false,sizeof(vis));
			scanf("%d%d",&n,&k);
			for(int j=0;j<k;j++)
			{
            int  b, c;
            cin >> b >> c;
            P.e = b;
            P.w = c;
            G[n].push_back(P);
            P.e = n;
            G[b].push_back(P);
			}
			}
			for(inti=0;i<m;i++)
			{
			int ans = Dij(0,n);
			printf("%d %d\n",n,ans);
        }
    return 0;
}

C++: #include <iostream>
using namespace std;
#define MAX 100
#define INFTY 1<<22
#define WHITE 0
#define GRAY 1
#define BLACK 2

int gMatrix[MAX][MAX];

void dijkstra(int n){
    // 最小の重みを記録する
    int minV;
    // weight[v]に始点sからvまでの最短コストを保存する
    int weight[MAX];
    // 訪問状態を記録
    int color[MAX];
    // 1.初期化
    for(int i = 0;i < n;++i){
        weight[i] = INFTY;
        color[i] = WHITE;
    }
    // 始点
    weight[0] = 0;
    color[0] = GRAY;
    
    while(1){
        minV = INFTY;
        // 頂点を示す
        int u = -1;
        // 2.1weight[u]が最小である頂点を決定する
        for(int i = 0;i < n;++i){
            if(minV > weight[i] && color[i] != BLACK){
                u = i;
                minV = weight[i];
            }
        }
        if(u == -1)break;
        color[u] = BLACK;
        
        for(int v = 0;v < n;++v){
            // 辺が存在する
            if(color[v] != BLACK && gMatrix[u][v] != INFTY){
                // 2.2最短コストを更新する
                // この処理の終了後weight[v]sからS内の頂点のみを経由したvまでの最短コストが記録される
                if(weight[v] > weight[u] + gMatrix[u][v]){
                    weight[v] = weight[u] + gMatrix[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }
    // 出力
    for(int i = 0;i < n;++i){
        cout << i << " " << ( weight[i] == INFTY ? -1 : weight[i] ) << endl;
    }
}

int main(){
    int n;
    cin >> n;
    
    for(int i = 0;i < n;++i){
        for(int j = 0;j < n;++j){
            gMatrix[i][j] = INFTY;
        }
    }
    
    int k,c,u,v;
    for(int i = 0;i < n;++i){
        cin >> u >> k;
        for(int j = 0;j < k;++j){
            cin >> v >> c;
            gMatrix[u][v] = c;
        }
    }
    dijkstra(n);
    return 0;
}

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

#define go first
#define ct second

int cost[100 + 10] , cost_ps[100 + 10];
int n,vf,k,v,c;

int v_k[100];

vector< pair<int, int> > went[100];

pair<int, int> p_tmp;

int  check_go(int st)
{
	int i;
	int ret=0;

	for (i = 0; i < v_k[st]; i++)
	{
		if (cost_ps[went[st][i].go] > cost[st] + went[st][i].ct || cost_ps[went[st][i].go] == -1)
		{
			cost_ps[went[st][i].go] = cost[st] + went[st][i].ct;
		}
	}

	for (i = 1; i < n; i++)
	{
		if ( (cost_ps[ret] > cost_ps[i] && cost[i]==-1 && cost_ps[i]!=-1 ) || cost[ret] != -1 )
		{
			cout << "B" << cost[ret] << endl;
			ret = i;
			printf("ret=%d\n", ret);
		}
	}
	cout << cost_ps[ret] << endl;

	cost[ret] = cost_ps[ret];
	cout << "A" << cost[ret] << endl;

	return ret;

}

int main()
{
	int i,j;
	int st_num=0;

	cin >> n;

	for (i = 0; i < n; i++)
	{
		cost[i] = cost_ps[i] = -1;

		cin >> vf ;
		cin >> v_k[vf];
		for (j = 0; j < v_k[vf] ; j++)
		{
			cin >> p_tmp.go >> p_tmp.ct;

			went[vf].push_back(p_tmp);
		}
	}

	cost[0] = cost_ps[0] = 0;

	for (i = 1; i < n; i++)
	{
		st_num = check_go(st_num);
	}

	for (i = 0; i < n; i++)
	{
		cout << i << " " << cost_ps[i] << endl;
	}

	return 0;
}

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

const int N=100;
const int INF=2000000000;
const int WHITE=0;
const int GRAY=1;
const int BLACK=2;

int n,M[N][N],d[N],color[N];

void dijkstra(){
    d[0]=0;
    color[0]=GRAY;
    while(true){
        int min_des=INF;
        int vertex=-1;
        for(int i=0;i<n;i++){
            if(min_des>d[i]&&color[i]==GRAY){
                min_des=d[i];
                vertex=i;
            }
        }
        if(vertex==-1) break;
        color[vertex]=BLACK;
        for(int i=0;i<n;i++){
            if(color[i]!=BLACK&&M[vertex][i]<INF){
                if(d[i]>d[vertex]+M[vertex][i]){
                    d[i]=d[vertex]+M[vertex][i];
                    color[i]=GRAY;
                }
            }
        }
    }
}        

int main(){
    int u,k,v,c;
    cin>>n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            M[i][j]=INF;
        }
        d[i]=INF;
        color[i]=WHITE;
    }
    for(int i=0;i<n;i++){
        cin>>u>>k;
        for(int j=0;j<k;j++){
            cin>>v>>c;
            M[u][v]=c;
        }
    }

    dijkstra();

    for(int u=0;u<n;u++){
        cout<<u<<' '<<d[u]<<endl;
    }
}