Go: package main

import (
	"fmt"
	"container/heap"
)

type Node struct {
	Id int
	Dis int
}

type PriorityQueue []*Node

func (pq PriorityQueue) Len() int { return len(pq) }

func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].Dis < pq[j].Dis
}

func (pq PriorityQueue) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PriorityQueue) Push(x interface{}) {
	*pq = append(*pq, x.(*Node))
}

func (pq *PriorityQueue) Pop() interface{} {
	n := len(*pq)
	pop := (*pq)[n-1]
	*pq = (*pq)[0:n-1]
	return pop
}

func main() {
	var n int
	fmt.Scan(&n)

	g := make([][]int, n)
	c := make([][]int, n)
	pq := make(PriorityQueue, 0, n)
	d := make([]int, n)
	for i := 0; i < n; i++ {
		var u,k int
		fmt.Scan(&u)
		fmt.Scan(&k)
		g[u] = make([]int, k)
		c[u] = make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Scan(&g[u][j])
			fmt.Scan(&c[u][j])
		}

		if u == 0 {
			d[u] = 0
		} else {
			d[u] = 1 << 30
		}
		pq.Push(&Node{u, d[u]})
	}
	heap.Init(&pq)

	for pq.Len() > 0 {
		node := heap.Pop(&pq).(*Node)
		for i := 0; i < len(g[node.Id]); i++ {
			nextId := g[node.Id][i]
			nextDis := node.Dis + c[node.Id][i]
			if nextDis < d[nextId] {
				d[nextId] = nextDis
				heap.Push(&pq, &Node{nextId, nextDis})
			}
		}
	}

	for i := 0; i < n; i++ {
		fmt.Println(i, d[i])
	}
}

C++: /*
 * Problem Description: Graph II - Single Source Shortest Path I
 * Category: Graph/Dijkstra
 * Author: Khan
 * Date: 22th October, 2017
 */

#include <iostream>

using namespace std;

static const int MAX = 1000;
static const int INF = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

void dijkstra()
{
    int u, minv;
    int d[MAX], color[MAX];

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

    d[0] = 0;
    color[0] = GRAY;
    while(true)
    {
        minv = INF;
        u = -1;
        for (int i = 0; i < n; ++i)
        {
            if(minv > d[i] && color[i] != BLACK)
            {
                u = i;
                minv = d[i];
            }
        }
        if(u == -1)
            break;
        color[u] = BLACK;
        for (int v = 0; v < n; ++v)
        {
            if(color[v] != BLACK && M[u][v] != INF)
            {
                if(d[v] > d[u] + M[u][v])
                {
                    d[v] = d[u] + M[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }

    for(int i = 0; i < n; ++i)
        cout << i << " " << (d[i] == INF ? -1 : d[i]) << endl;
}

int main(int argc, char const *argv[])
{
    //freopen("sample.txt", "r", stdin);
    cin >> n;
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            M[i][j] = INF;
    int k, c, u, v;
    for (int i = 0; i < n; ++i)
    {
        cin >> u >> k;
        for (int j = 0; j < k; ++j)
        {
            cin >> v >> c;
            M[u][v] = c;
        }
    }
    dijkstra();
    return 0;
}

C++: #include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n,M[MAX][MAX];

void dijkstra(){
int minv;
int d[MAX],color[MAX];

for(int i=0;i<n;i++){
d[i] = INFTY;
color[i] = WHITE;
}

color[0] = GRAY;
d[0] = 0;

while(1){
minv = INFTY;
int u = -1;
for(int i=0;i<n;i++){
if(minv>d[i]&&color[i]!=BLACK){
u = i;
minv = d[i];
}
}
if(u==-1)break;
color[u] = BLACK;

for(int v=0;v<n;v++){
if(color[v]!=BLACK&&M[u][v]!=INFTY){
if(d[v]>d[u]+M[u][v]){
d[v] = d[u] + M[u][v];
color[v] = GRAY;
}
}
}
}
for(int i=0;i<n;i++){
cout<<i<<" "<<(d[i]==INFTY?-1:d[i])<<endl;
}
}

int main(){
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
M[i][j] = INFTY;
}
}
int k,c,u,v;
for(int i=0;i<n;i++){
cin>>u>>k;
for(int j=0;j<k;j++){
cin>>v>>c;
M[u][v] = c;
}
}
dijkstra();
return 0;
}

C++: #include <iostream>
#define MAX 100100
#define WHITE 0
#define BLACK 1

int main() {
  int n;
  std::cin >> n;
  int d[110];
  int color[110];

  int G[110][110];
  for(int i=0; i<n; ++i) {
    for(int j=0; j<n; ++j) G[i][j] = MAX;
  }

  for(int i=0; i<n; ++i) {
    d[i] = MAX;
    color[i] = WHITE;
  }

  for(int i=0; i<n; ++i) {
    int u, k;
    std::cin >> u >> k;
    for(int j=0; j<k; ++j) {
      int to, w;
      std::cin >> to >> w;
      G[u][to] = w;
    }
  }

  d[0] = 0;

  // colorも変更する?

  while(true) {
    int u;
    int minicost = MAX;

    // d[s]が最小になる点を選ぶ
    for(int i=0; i<n; ++i) {
      if(d[i] < minicost && color[i] != BLACK) {
        minicost = d[i];
        u = i;
      }
    }

    if(minicost == MAX) break;
    color[u] = BLACK;

    for(int v=0; v<n; ++v) {
      if(d[u] + G[u][v] < d[v]) {
        d[v] = d[u] + G[u][v];
        //p[u] = u;
      }
    }
  }

  for(int i=0; i<n; ++i) {
    std::cout << i << " " << d[i] << std::endl;
  }
}

C++: #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cctype>
#define _USE_MATH_DEFINES
#include <math.h>
#include <string>
#include <list>
using namespace std;

int n, m[100][100], d[100], p[100];

string color[100];

void dijkstra(){
  for(int i = 0; i < n; i++){
    color[i] = "white";
    d[i] = 10000000;
  }

  d[0] = 0;
  p[0] = -1;

  while(1){
    int mincost = 10000000, u;

    for(int i = 0; i < n; i++){
      if(color[i] != "black" && d[i] < mincost){
        mincost = d[i];
        u = i;
      }
    }
    if(mincost == 10000000) break;

    color[u] = "black";

    for(int v = 0; v < n; v++){
      if(color[v] != "black" && m[u][v] < 10000000){
        if(d[u] + m[u][v] < d[v]){
          d[v] = d[u] + m[u][v];
          p[v] = u;
          color[v] = "glay";
        }
      }
    }
  }
}


int main(){

  cin >> n;

  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      m[i][j] = 10000000;
    }
  }

  for(int i = 0; i < n; i++){
    int id, k, v, c;
    cin >> id >> k;
    for(int j = 0; j < k; j++){
      cin >> v >> c;
      m[id][v] = c;
    }
  }

  dijkstra();



  for(int i = 0; i < n; i++){
    cout << i << " " << d[i] << endl;
  }

  return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <vector>
#include <map>
using namespace std;

typedef vector<int>::iterator vitr;
typedef map<int, int>::iterator mitr;

map<int, int> w[100];
int d[100];

vector<int> a;
vector<int> b;

void findPath(){
    int candiW = INT_MAX;
    vitr candiI;
    for(vitr i=a.begin();i!=a.end();i++){
        for(vitr j=b.begin();j!=b.end();j++){
            mitr k = w[*i].find(*j);
            if(k == w[*i].end())continue;
            if(k->second + d[*i] < candiW){
                candiW = k->second + d[*i];
                candiI = j;
            }
        }
    }
    a.push_back(*candiI);
    d[*candiI] = candiW;
    b.erase(candiI);
}

int main(){
    int i,j,u,k,n,v,c;

    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d %d",&u,&k);
        for(j=0;j<k;j++){
            scanf("%d %d",&v,&c);
            w[u][v] = c;
        }
    }

    d[0] = 0;
    a.push_back(0);
    for(i=1;i<n;i++)b.push_back(i);

    for(i=1;i<n;i++)findPath();

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

    return 0;
}