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
}

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++: #include <iostream>
#include <vector>
using namespace std;
#define INF 10000000

typedef struct{
  int s,d;
  int w;
}ver;

ver A[100];
  int d[100],hsize=0;

void insert(ver key){
  int i=hsize;
  A[i]=key;
  hsize++;
  while(i>0&&A[i].w<A[(i-1)/2].w){
    swap(A[i],A[(i-1)/2]);
    i=(i-1)/2;
  }
}

void modheap(int i){
  int l=i*2+1;
  int r=i*2+2;
  int larger = i;
  if (l<hsize&&A[larger].w>A[l].w)larger=l;
  if (r<hsize&&A[larger].w>A[r].w)larger=r;
  if (larger!=i){
    swap(A[larger],A[i]);
    modheap(larger);
  }
}

ver extract(){
  int i=0;
  ver ret=A[0];
  A[0]=A[hsize-1];
  hsize--;
  modheap(0);
  return ret;
}

int main(){
  int n,k,ti,tv,tc;
  //int d[100];
  vector<int> v[100],w[100];
  
  int minc,mi,i;
  bool flg[100];
  
  cin >> n;
  for (i=0;i<n;i++){
    cin >>ti>>k;
    for (int j=0;j<k;j++){
      cin >> tv>>tc;
      v[ti].push_back(tv);
      w[ti].push_back(tc);
      ver t;
      t.s=i;
      t.d=tv;
      t.w=tc;
      insert(t);
    }
    d[i]=INF;
    flg[i]=false;
  }

  d[0]=0;
  
  while (hsize>0){
    ver t=extract();
    mi=t.s;
    for (i=0;i<n;i++){
      //cout << d[i] << " ";
    }
    // cout <<" :" << mi << endl;
    flg[mi]=true;
    for (i=0;i<v[mi].size();i++){
      //cout <<v[mi][i] <<" "<<d[mi]+w[mi][i];
      if (d[v[mi][i]]>d[mi]+w[mi][i]){
	//cout <<"+ " ;
	d[v[mi][i]]=d[mi]+w[mi][i];
      }
      //cout << endl;
    }
  }
  
  for (i=0;i<n;i++){
    cout << i <<" "<<d[i]<<endl;
  }
  
  return 0;
}

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

const int Max = 10000;
const int Infty = (1 << 21);
const int white = 0, gray = 1, black = 2;

int d[Max], color[Max];
int n;

vector<pair<int, int> > adj[Max];

void dijkstra(int s){
    priority_queue<pair<int, int> > PQ;
    for(int i=0; i<n; i++){
        d[i] = Infty;
        color[i] = white;
    }
    d[s] = 0;
    color[s] = gray;
    PQ.push(make_pair(0, 0)); //(d[u], u) u:be adjacent to s

    while(!PQ.empty()){
        pair<int, int> f = PQ.top();
        PQ.pop();
        int u = f.second;
        color[u] = black;

        if(d[u] < f.first*(-1) ) continue;

        for(int i=0; i<adj[u].size(); i++){
            int v = adj[u][i].first;
            if(color[v] == black) continue;
            if(d[u] + adj[u][i].second < d[v]){
                d[v] = d[u] + adj[u][i].second;
                color[v] = gray;
                PQ.push(make_pair(d[v] * (-1), v));
            }
        }
    }
    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(0);

    return 0;
}