Go: package main

import (
	"fmt"
	"bufio"
	"os"
	"strconv"
	"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)

	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		u, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		k, _ := strconv.Atoi(sc.Text())
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			sc.Scan()
			g[u][j], _ = strconv.Atoi(sc.Text())
			sc.Scan()
			c[u][j], _ = strconv.Atoi(sc.Text())
		}

		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})
			}
		}
	}

	wr := bufio.NewWriter(os.Stdout)
	for i := 0; i < n; i++ {
		wr.WriteString(strconv.Itoa(i))
		wr.WriteString(" ")
		wr.WriteString(strconv.Itoa(d[i]))
		wr.WriteString("\n")
	}
	wr.Flush()
}

C++: #include <vector>
#include <queue>
#include <iostream>
#include <stdio.h>

using namespace std;

#define NODE_NUM 10000
#define INF 100000

typedef struct Node {
    //????????????????????????????????????
    int idx;
    
    // ????????????????????????????????¨??????????????±
    vector<int> edges_to;    // ?????¨???????????\?¶??????????????????????
    vector<int> edges_cost;  // ?????¨??????????????????
    
    // ??????????????????????????????????????????
    bool done;  // ?¢??????????????????????
    int cost;   // ????????????????????????????????§??????????????????????°??????????
}Node;

Node nodes[NODE_NUM];


struct NodeCompare
{
    bool operator()(const Node &t1, const Node &t2) const
    {
        //?????????????????????????????????????????????????????????????????????????????´?????????????????????????????????
        return t1.cost > t2.cost;
    }
};

void Dijkstra(int node_num, int start_node){
    
    // ?????????
    for (int i =0 ; i < node_num; i++) {
        nodes[i].done = false;
        nodes[i].cost = INF;
        nodes[i].idx = i;
    }

    //????????????????????\???????°?????????????????????????
    priority_queue<Node, vector<Node>, NodeCompare> q;
    
    // ????????????????????????????????????0
    nodes[start_node].cost = 0;
    q.push(nodes[start_node]);
    
    // ??¢?????´???????????????
    while(!q.empty()){
        
        // ?¢????????????????????????????
        Node doneNode = q.top();
        q.pop();
        
        //???????¢?????????????????????????????????????????????¨??±?????????
        if (doneNode.done) continue;
        
        // ?¢????????????°????????????
        nodes[doneNode.idx].done = true;
        
        // ??\?¶?????????????????????±?????´??°??????
        for(int i = 0; i < doneNode.edges_to.size(); i++){
            
            int to = doneNode.edges_to[i];
            int cost = doneNode.cost + doneNode.edges_cost[i];
            if( nodes[to].cost == INF || cost < nodes[to].cost){
                nodes[to].cost = cost;
                if(!nodes[to].done){
                    q.push(nodes[to]);
                }
            }
        }
    }
}

int main( ){
    
    int i, j, n, k, v, c, u;
    scanf("%d", &n);

    for (i = 0; i < n; i++) {
        scanf("%d %d",&u,  &k);
        
        for (j =0 ; j < k; j++) {
            scanf("%d %d", &v, &c);
            nodes[u].edges_cost.push_back(c);
            nodes[u].edges_to.push_back(v);
        }
    }
    
    Dijkstra(n, 0);
    
    for (i=0; i<n; i++) {
        printf("%d %d\n", i, nodes[i].cost);
    }
    
    return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1 << 20);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n;
vector<pair<int, int> > adj[MAX]; // 重み付き有向グラフの隣接リスト表現(重み，位置)
void dijkstra()
{
    priority_queue<pair<int, int> > PQ; // 優先度付きキューPQを設定
    int color[MAX]; // 訪問状態
    int d[MAX]; // 最短コストを初期化
    for (int i = 0; i < n; i++) {
        d[i] = INFTY; // 最短コストを初期化
        color[i] = WHITE; // 訪問状態を初期化
    }
    // 始点の最短コスト，訪問状態
    d[0] = 0;
    PQ.push(make_pair(0, 0));
    color[0] = GRAY;

    while (!PQ.empty()) {
        pair<int, int> f = PQ.top();
        PQ.pop();
        int u = f.second; // 現在の位置にPQの先頭の位置を代入

        color[u] = BLACK; // uは訪問完了に

        //最小値を取り出し，それが最短でなければ無視
        if (d[u] < f.first * (-1)) {
            continue;
        }

        for (int j = 0; j < adj[u].size(); j++) {
            int v = adj[u][j].first; // vはu->jの重み
            if (d[v] > d[u] + adj[u][j].second) { // vまでの重さと，uまでの重さとu->jの重さを比べる
                d[v] = d[u] + adj[u][j].second;
                // priority_queueはデフォルトで大きい値を優先するため-1をかける
                PQ.push(make_pair(d[v] * (-1), v));
                color[v] = GRAY;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
    }
}
int main()
{
    int k, u, v, c;

    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> u >> k;
        for (int j = 0; j < k; j++) {
            cin >> v >> c;
            adj[u].push_back(make_pair(v, c));
        }
    }

    dijkstra();

    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<20);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n;
//???????????????????????\??¨??¨??????
vector<pair<int, int> >adj[MAX];

void dijkstra(){
    //?????\??¨
    priority_queue<pair<int, int>,vector<pair<int,int> >,greater<pair<int,int> > >PQ;
    //?????????????¢????
    int color[MAX];

    int d[MAX];
    for(int i = 0; i<n; i++){
        d[i] = INFTY;
        color[i] = WHITE;
    }

    d[0] = 0;
    PQ.push(make_pair(0,0));
    color[0] = GRAY;

    while(!PQ.empty()){
        pair<int, int>f = PQ.top();
        PQ.pop();

        int u = f.second;

        color[u] = BLACK;

        // ??????????°???????????????????????????????????????\
        if(d[u]<f.first)
            continue;

        for(int j = 0;j<adj[u].size(); j++){
            int v = adj[u][j].first;
            if(color[v]==BLACK)continue;
            if(d[v]>d[u]+adj[u][j].second){
                d[v]=d[u]+adj[u][j].second;
                //priority_queue ?????????????????§??????????????????-1
                PQ.push(make_pair(d[v],v));
                color[v]=GRAY;
            }
        }
    }

    for(int i=0;i<n;i++)
        cout<<i<<" "<<(d[i]==INFTY?-1:d[i])<<endl;
}

int main(){
    int k,u,v,c;

    cin>>n;
    for(int i=0;i<n;i++){
        cin>>u>>k;
        for(int j=0;j<k;j++){
            cin>>v>>c;
            adj[u].push_back(make_pair(v,c));
        }
    }

    dijkstra();
}