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 <iostream>
#include <vector>
#include <queue>

using namespace std;

#define MAX 10000
#define INF 1000000
#define pii pair<int,int>

vector<pii> eclist[MAX];//[[index,cost]]

void bfs(int start,int n){
    queue<int> q; // index
    vector<bool> visited(n, false);
    q.push(start);
    while (!q.empty()){
        int u = q.front();q.pop();
        visited[u] = true;
        for (pii vpair : eclist[u]) {
            int v = vpair.first;
            if(!visited[v]){
                q.push(v);
            }
        }
    }
}

void dijkstra_print_distance(int start, int n){
    priority_queue<pii> q; // cost,index
    vector<int> costs(n,INF);
    vector<bool> visited(n, false);
    costs[0] = 0;
    q.push(make_pair(0, start));
    while (!q.empty()){
        pii upair = q.top();q.pop();
        int u = upair.second,ucost = upair.first * -1;
        visited[u] = true;
        if( costs[u] < ucost) {
            continue;
        }
        for (pii vpair : eclist[u]) {
            int v = vpair.first,vcost = vpair.second;
            if(visited[v])continue;
            if (costs[v] > costs[u] + vcost){
                costs[v] = costs[u] + vcost;
                q.push(pii(costs[v] * -1, v));
            }
        }
    }
    for (int i = 0; i < n; ++i) cout << i << " " << costs[i] << endl;
}

int main(){
    //freopen("in", "r", stdin);
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int id,m,v,c;
        cin >> id >> m;
        for (int j = 0; j < m; ++j) {
            cin >> v >> c;
            eclist[id].push_back(pair<int,int>(v,c));
        }
    }

    dijkstra_print_distance(0, n);

    return 0;
}