Go: package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"strconv"
)

const NIL = -1

type Node struct {
	id     int
	weight int
}

func init() {
	sc.Split(bufio.ScanWords)
}

type NodeHeap []Node

func (h NodeHeap) Len() int           { return len(h) }
func (h NodeHeap) Less(i, j int) bool { return h[i].weight < h[j].weight }
func (h NodeHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *NodeHeap) Push(x interface{}) {
	*h = append(*h, x.(Node))
}

func (h *NodeHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

var sc = bufio.NewScanner(os.Stdin)

func scanInt() int {
	num, _ := strconv.Atoi(scanString())
	return num
}

func scanString() string {
	sc.Scan()
	return sc.Text()
}

func init() {
	sc.Split(bufio.ScanWords)
}

func main() {
	n := scanInt()

	list := make([][]int, n)
	weight := make([]int, n)
	for i := range list {
		list[i] = make([]int, n)
		weight[i] = NIL
		for j := range list[i] {
			list[i][j] = NIL
		}
	}

	for i := 0; i < n; i++ {
		u := scanInt()
		k := scanInt()
		for j := 0; j < k; j++ {
			v := scanInt()
			w := scanInt()
			list[u][v] = w
		}
	}

	start := Node{id: 0, weight: 0}
	h := &NodeHeap{start}
	heap.Init(h)

	for h.Len() > 0 {
		node := heap.Pop(h).(Node)
		if weight[node.id] != NIL {
			continue
		}
		weight[node.id] = node.weight

		for i, w := range list[node.id] {
			if w == NIL {
				continue
			}
			heap.Push(h, Node{id: i, weight: w + node.weight})
		}
	}

	w := bufio.NewWriter(os.Stdout)
	for i := 0; i < n; i++ {
		fmt.Fprint(w, i)
		fmt.Fprint(w, " ")
		fmt.Fprint(w, weight[i])
		fmt.Fprintln(w)
	}
	w.Flush()
}

C++: #include<bits/stdc++.h>
using namespace std;
const int maxn = 1111;
#define INF 0x3f3f3f
int n;
struct qnode				//dis
{
	int v, c;
	qnode(int _v=0,int _c=0):v(_v),c(_c){}
	bool operator < (const qnode &r)const
	{
		return c > r.c;
	}
};
struct Edge
{
	int v,cost;
	Edge(int _v=0,int _cost =0):v(_v),cost(_cost){}
};
vector<Edge> E[maxn];
bool vis[maxn];
int dis[maxn];
void Dijkstra(int n, int s)
{
	memset(vis, false, sizeof(vis));
	fill(dis, dis + n, INF);
	priority_queue<qnode> que;			//存dis
	dis[s] = 0;
	que.push(qnode(s, 0));
	qnode temp;
	while (que.size())
	{
		temp = que.top();
		que.pop();
		int u = temp.v;
		if (vis[u])
			continue;
		vis[u] = true;
		for (int i = 0;i < E[u].size();i++)
		{
			int v = E[u][i].v;
			int cost = E[u][i].cost;
			if (!vis[v] && cost + dis[u] < dis[v])
			{
				dis[v] = dis[u] + cost;
				que.push(qnode(v, dis[v]));
			}
		}
	}
}
void addedge(int u, int v, int w)
{
	E[u].push_back(Edge(v, w));
}
int main()
{
	cin >> n;
	for (int i = 0;i < n;i++)
	{
		int a, b, w,k;
		cin >> a >> k;
		for (int j = 0;j < k;j++)
		{
			cin >> b >> w;
			addedge(a, b, w);
		}
	}
	Dijkstra(n,0);
	for (int i = 0;i < n;i++)
	{
		cout<<i<<" "<< dis[i] << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

constexpr int INF = (1 << 30) - 1;
int n;
int dist[105][105];
int d[105];
bool used[105] = {};

void Dijkstra()
{

        fill_n(d, 105, INF);

        d[0] = 0;
        while ( true ) {
                int u = -1;
                for ( int i = 0; i < n; i++ ) {
                        if ( !used[i] && (u == -1 || d[u] > d[i]) ) {
                                u = i;
                        }
                }
                if ( u == -1 ) break;
                used[u] = true;
                for ( int i = 0; i < n; i++ ) {
                        d[i] = min(d[i], d[u] + dist[u][i]);
                }
        }
}

int main()
{
        fill_n(*dist, 105 * 105, INF);
        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;
                        dist[u][v] = min(dist[u][v], c);
                }
        }
        Dijkstra();
        for ( int i = 0; i < n; i++ ) {
                cout << i << " " << d[i] << endl;
        }

        return (0);
}

C++: #include <iostream>
#include <queue>
#include <utility>
#include <vector>

struct Edge {
  int from, to, weight;
  Edge(int from, int to, int weight) : from(from), to(to), weight(weight) {}
};

struct Node {
  std::vector<Edge> ongoingEdges;
  void addEdge(Edge edge) {
    ongoingEdges.push_back(edge);
  }
};

class Graph {
private:
  std::vector<Node> nodes;
  int size;
public:
  Graph(int size): size(size) {
    nodes.resize(size);
  }
  void addEdge(Edge edge) {
    nodes[edge.from].addEdge(edge);
  }

  std::vector<int> calculateDist(int source) {
    std::vector<int> dist(size, (1 << 30));
    std::priority_queue< std::pair<int, int>, std::vector< std::pair<int, int> >, std::greater< std::pair<int, int> > > pq;

    pq.push(std::make_pair(0, source));
    dist[source] = 0;

    while(!pq.empty()) {
      int from = pq.top().second;
      pq.pop();

      for(Edge edge: nodes[from].ongoingEdges) {
        if(dist[edge.to] > dist[from] + edge.weight) {
          dist[edge.to] = dist[from] + edge.weight;
          pq.push({dist[edge.to], edge.to});
        }
      }

    }

    return dist;
  }
};

int main() {
  int n;
  std::cin >> n;
  Graph graph(n);

  for(int i = 0; i < n; i++) {
    int u, k;
    std::cin >> u >> k;

    for(int i = 0; i < k; i++) {
      int v, c;
      std::cin >> v >> c;
      graph.addEdge(Edge(u, v, c));
    }

  }

  std::vector<int> dist = graph.calculateDist(0);

  for(int i = 0; i < n; i++) {
    std::cout << i + 1 << ' ' << dist[i] << std::endl;
  }

}

C++: #include<iostream>
#define REP(i,n) for(int i=0;i<(n);i++)
#define INF 1000000
#define BLACK 2
#define GRAY 1
#define WHITE 0
using namespace std;

int Node[100][100];
int Cost[100];

void dijkstra()
{
	int Color[100];
	REP(i, 100)Color[i] = WHITE;
	REP(i, 100)Cost[i] = INF;

	Color[0] = GRAY;
	Cost[0] = 0;

	while (true)
	{
		int min_index = -1;
		int min_value = INF;
		REP(i, 100)
		{
			if (Color[i] != BLACK && min_value>Cost[i])
			{
				min_value = Cost[i];
				min_index = i;
			}
		}
		if (min_index == -1)break;

		REP(i, 100)
		{
			if (Color[i] != BLACK && i != min_index && Node[min_index][i]!=INF && Node[min_index][i]+min_value<Cost[i])
			{
				Cost[i] = min_value+Node[min_index][i];
				Color[i] = GRAY;
			}
		}
		Color[min_index] = BLACK;
	}
}

int main()
{
	REP(i,100)
	{
		REP(j, 100)
		{
			Node[i][j] = INF;
		}
	}
	REP(i, 100)Node[i][i] = 0;
	int n;
	cin >> n;
	REP(i,n)
	{
		int u, k;
		cin >> u >> k;
		REP(j,k)
		{
			int v, c;
			cin >> v >> c;
			Node[u][v] = c;
		}
	}
	dijkstra();
	REP(i, n)
	{
		cout << i << " " << Cost[i] << endl;
	}

	return 0;
}

C++: #include<stdio.h>
main()
{
  int i,j,n,g,count=0;
  int V,A,A1,V1;
  int G[101][101],c[101],INF[101],p[101],mincost;

  for(i = 0; i < 101; i++){
    for(j = 0; j < 101; j++)
      G[i][j] = -1;
  }

  scanf("%d",&n);

  for(i = 0; i < n; i++){
    scanf("%d%d",&V,&A);
    for(j = 0; j < A; j++){
      scanf("%d%d",&V1,&A1);
      G[A][A1] = A1;
    }
  }

  for(i = 0; i < n; i++){
    c[i] = 0;
    p[i] = -1;
    INF[i] = 10000001;
  }

  INF[0] = 0;

  while(1){
    mincost = 10000001;
    for(i = 0; i < n; i++){
      if(c[i] != 2 && INF[i] < mincost){
        mincost = INF[i];
        g = i;
      }
    }
    if(mincost == 10000001)break;

    c[g] = 2;


    for(i = 0; i < n; i++){
      if(G[g][i] != -1 && c[i] != 2 && (G[g][i]+INF[g]) < INF[i]){
        p[i] = g;
        INF[i] = G[g][i] + INF[g];
        c[i] = 1;
      }
    }
  }
INF[0] = 0;

  while(1){
    mincost = 10000001;
    for(i = 0; i < n; i++){
      if(c[i] != 2 && INF[i] < mincost){
        mincost = INF[i];
        g = i;
      }
    }
    if(mincost == 10000001)break;

    c[g] = 2;


    for(i = 0; i < n; i++){
      if(G[g][i] != -1 && c[i] != 2 && (G[g][i]+INF[g]) < INF[i]){
        p[i] = g;
        INF[i] = G[g][i] + INF[g];
        c[i] = 1;
      }
    }
  }
  for(i = 0; i < n; i++)printf("%d %d\n",i,INF[i]);
  return 0;
}