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 <cstdio>
#include <utility>
#include <climits>

int main(){
	std::priority_queue<std::pair<int, int>> queue;
	int n;
	std::scanf("%d", &n);
	std::vector<std::vector<std::pair<int, int>>> edges;
	std::vector<int> result(n, INT_MAX);
	for (auto i = 0; i < n; ++i){
		std::vector<std::pair<int, int>> edge;
		int u, k;
		std::scanf("%d %d", &u, &k);
		for (auto j = 0; j < k; ++j){
			int c, v;
			std::scanf("%d %d", &v, &c);
			edge.push_back(std::make_pair(v, c));
		}
		edges.push_back(edge);
	}
	queue.push(std::make_pair(0, 0));
	for (auto i = 0; i < n; ++i){
		while (result.at(queue.top().second) < -queue.top().first){
			//std::cout << queue.top().second << "qqqq" << queue.top().first << std::endl;
			queue.pop();
		}
		int dist = -queue.top().first; int vert = queue.top().second;
		queue.pop();
		result.at(vert) = dist;
		//std::cout << vert << "v-d" << dist << std::endl;
		for (auto j : edges.at(vert)){
			//std::cout << j.first << "(" << result.at(j.first) << ")" << "||" << j.second << "\n";
			if (result.at(j.first) > dist+ j.second){
				queue.push(std::make_pair(-dist - j.second, j.first));
				result.at(j.first) = dist + j.second;
			}
		}
	}
	for (auto i = 0; i < n; ++i){
		std::printf("%d %d\n", i, result.at(i));
	}
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX=10000;
static const int I=(1<<20);
static const int W=0;
static const int G=1;
static const int B=2;

int n;
vector<pair<int,int> > adj[MAX];

void di(){
  priority_queue<pair<int,int> > PQ;
  int color[MAX];
  int d[MAX];
  for(int i=0;i<n;i++){
    d[i]=I;
    color[i]=W;
  }


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

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

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

    for(int j=0;j<adj[u].size();j++){
      int v = adj[u][j].first;
      if(color[v]==B) continue;
      if(d[v]>d[u]+adj[u][j].second){
        d[v]=d[u]+adj[u][j].second;
        PQ.push(make_pair(d[v]*(-1),v));
        color[v]=G;
      }
    }
  }


  for(int i=0;i<n;i++){
    cout << i << " " << (d[i]==I?-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));
    }
  }

  di();

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

const int INF = 1<<20;

int n;
vector<pair<int, int>> adj[10005];


void dijkstra(){
    priority_queue<pair<int, int>> PQ;
    bool visited[n];
    int d[n];

    for(int i=0; i<n; i++){
        visited[i] = false;
        d[i] = INF;
    }

    PQ.push({0, 0});
    d[0] = 0;

    while(!PQ.empty()){

        pair<int, int> p = PQ.top(); PQ.pop();
        int u = p.second;

        visited[u] = true;

        if(d[u] < p.first * (-1)) continue;
        
        for(int i=0; i<adj[u].size(); i++){
            int v = adj[u][i].first;
            if(visited[v] == false && d[v] > d[u] + adj[u][i].second){
                d[v] = d[u] + adj[u][i].second;
                PQ.push({d[v] * (-1), v});
            }
        }
    }

    for(int i=0; i<n; i++){
        printf("%d %d\n", i, d[i]);
    }

}

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

    dijkstra();
}