Go: package main

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

const (
	MAX_N      = 10000
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest int
}

type Neighbor struct {
	node   int
	weight int
}

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

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	shortestList := make([]ShortestInfo, n)
	for i := 1; i < n; i++ {
		shortestList[i] = ShortestInfo{edges: []Edge{}, shortest: MAX_N*MAX_WEIGHT + 1}
	}

	adjacentMatrix, err := createAdjacentMatrix(n, sc)
	if err != nil {
		panic(err)
	}

	sssp([]int{0}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd(), v.shortest)
	}
}

func (si ShortestInfo) getEnd() int {
	if len(si.edges) == 0 {
		return 0
	} else {
		return si.edges[len(si.edges)-1].end
	}
}

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]Neighbor, error) {
	adjacentMatrix := make([][]Neighbor, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = []Neighbor{}
		vertexNum, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		for j := 0; j < vertexNum; j++ {
			v, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			c, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			adjacentMatrix[id] = append(adjacentMatrix[id], Neighbor{v, c})
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]Neighbor) {
	for len(nodeStack) > 0 {
		currentNode := nodeStack[0]
		nodeStack = nodeStack[1:]
		currentShortest := getShortest(currentNode, shortestList)
		adjacents := findAdjacents(currentNode, adjacentMatrix)
		for i := 0; i < len(adjacents); i++ {
			adj := adjacents[i]
			if currentShortest.shortest+adj.weight < getShortest(adj.end, shortestList).shortest {
				setShortest(adj.end, adj, currentShortest, shortestList)
				nodeStack = append(nodeStack, adj.end)
			}
		}
	}
}

func getShortest(node int, shortestList []ShortestInfo) ShortestInfo {
	return shortestList[node]
}

func setShortest(node int, edge Edge, currentShortest ShortestInfo, shortestList []ShortestInfo) {
	newEdges := make([]Edge, len(currentShortest.edges)+1)
	for i := 0; i < len(newEdges)-1; i++ {
		newEdges[i] = currentShortest.edges[i]
	}
	newEdges[len(newEdges)-1] = edge
	shortestInfo := ShortestInfo{edges: newEdges, shortest: currentShortest.shortest + edge.weight}
	shortestList[node] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]Neighbor) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for _, neighbor := range adjacents {
		edges = append(edges, Edge{start: currentNode, end: neighbor.node, weight: neighbor.weight})
	}
	return edges
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

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