Go: package main

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

const (
	MAX_N      = 100
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest 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{1}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd()-1, v.shortest)
	}
}

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

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]int, error) {
	adjacentMatrix := make([][]int, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = make([]int, n)
		for j := 0; j < n; j++ {
			adjacentMatrix[id][j] = -1
		}
		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][v] = c
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]int) {
	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-1]
}

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-1] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode-1]
	edges := []Edge{}
	for i, v := range adjacents {
		if v > 0 {
			edges = append(edges, Edge{start: currentNode, end: i + 1, weight: v})
		}
	}
	return edges
}

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

C++: #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;

#define REP(i,n) for(int i=0;(i)<(n);(i)++)

static const int INFTY = (1 << 29);
static const int WHITE = 0; //?????¢?´¢
static const int GRAY = 1; //??¢?´¢??????
static const int BLACK = 2; //?¨??????????

int n, M[101][101];

void dijkstra(void) {
	int dist[101]; //?§????????????????i????§????????????????????????????
	int color[101]; //?¨??????¶???(???or??°or???)

	//?????????????????§?????????????¨??????¶???????????§?????????
	REP(i, n) {
		dist[i] = INFTY;
		color[i] = WHITE;
	}

	dist[0] = 0; //?§????0??????0?????§???????????????0
	color[0] = GRAY; //0?????¢?´¢??????	

	//?????¢?´¢???????????????????????????????°??????????????§????????????????????????´??°????????????
	int minCost;
	while (true) {
		minCost = INFTY; //????°??????????????????????
		int minNode = -1; //????°?????????????????????????????????????
		REP(i, n) {
			if (minCost > dist[i] && color[i] != BLACK) {
				minNode = i;
				minCost = dist[i];
			}
		}
		if (minNode == -1) break; //-1???????????¨???????????¨????????????????????????????????£?????¨???????????¨

		color[minNode] = BLACK; //????°??????????????????????????§??????????????¨???????????????????

		//??¢?´¢????????????????????????????????´??°??????
		REP(v, n) {
			if (color[v] != BLACK && M[minNode][v] != INFTY) {
				if (dist[v] > dist[minNode] + M[minNode][v]) {
					dist[v] = dist[minNode] + M[minNode][v];
					color[v] = GRAY;
				}
			}
		}
	}
	
	REP(i, n) {
		cout << i << " " << (dist[i] == INFTY ? -1 : dist[i]) << endl;
	}

}

int main() {
	cin >> n;

	//??£??\???????????????????????§?????????
	REP(i, n) {
		REP(j, n) {
			M[i][j] = INFTY;
		}
	}

	//??£??\??????????????????
	int u, k, v, c;
	REP(i, n) {
		cin >> u >> k;
		REP(j, k) {
			cin >> v >> c;
			M[u][v] = c;
		}
	}

	dijkstra();

	
	return 0;
}

C++: #include<cstdio>
#include<iostream>
#define INF 200001 
using namespace std;
int main(){
 int u,k,C,V,A[1000][1000],D[1000][1000],n;
  scanf("%d",&n);
   for(int i=0;i<n;i++)for(int j=0;j<n;j++)D[i][j] = INF;
  for(int i=0;i<n;i++){
      scanf("%d %d",&u,&k);    
      for(int j=0;j<k;j++){
    scanf("%d %d",&V,&C);
    D[u][V] = C;
      }    
  }
  for(int i=0;i<n;i++)D[i][i] = 0;
  for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)D[i][j]= min(D[i][j],D[i][k] + D[k][j]);
  for(int i=0;i<n;i++)printf("%d %d\n",i,D[0][i]);
  return 0;
}

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


int main() {
    int N; cin >> N;
    int u, k, v, c; 
    const int inf = 100000000;
    

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

    int dist[N]; 
    priority_queue<pair<int, int> > que;

    for (int i = 0; i < N; ++i) {
        if (i) dist[i] = inf;
        else dist[i] = 0;
    }
    que.push(make_pair(0, 0));

    while (!que.empty()) {
        pair<int, int> f = que.top(); que.pop();
        int cur_cost = f.first*(-1);
        int cur_vtx = f.second;

        if (dist[cur_vtx] < cur_cost) continue;

        for (int i = 0; i < G[cur_vtx].size(); ++i) {
            int next_cost = G[cur_vtx][i].first;
            int next_vtx = G[cur_vtx][i].second;

            if (dist[next_vtx] > cur_cost + next_cost) {
                dist[next_vtx] = cur_cost + next_cost;
                que.push(make_pair(dist[next_vtx]*(-1), next_vtx));
            }
        }   
    }

    for (int v = 0; v < N; ++v) cout << v<< " " << dist[v] << endl;

    return 0;
}