Go: package main

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

//make priority queue
type Item struct {
	id       int
	priority int // this state is priority and distans from start
	index    int
}

type PriorityQueue []*Item

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

// we want the ascending-priority-queue.
// So we use less than here.
func (pq PriorityQueue) Less(i, j int) bool {
	return pq[i].priority < pq[j].priority
}

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

func (pq *PriorityQueue) Push(x interface{}) {
	n := len(*pq)
	item := x.(*Item)
	item.index = n
	*pq = append(*pq, item)
}

func (pq *PriorityQueue) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	item.index = -1 //for safety
	*pq = old[0 : n-1]
	return item
}

func (pq *PriorityQueue) update(dist int, id int) {
	for _, i := range *pq {
		if i.id == id {
			if i.priority > dist {
				i.priority = dist
			}
		}
	}
}

// the main code
func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	n, _ := strconv.Atoi(sc.Text())
	return n
}

func dikstra(dist [][]int, n int) []int {
	// preparate priority queue
	inf := 1 << 30
	pq := make(PriorityQueue, n)
	shortests := make([]int, n)
	for i := 0; i < n; i++ {
		pq[i] = &Item{
			id:       i,
			priority: inf,
			index:    i,
		}

		shortests[i] = inf
	}
	pq[0].priority = 0
	shortests[0] = 0

	for pq.Len() > 0 {
		item := heap.Pop(&pq).(*Item)
		shortests[item.id] = item.priority
		for id, d := range dist[item.id] {
			if d != -1 {
				pq.update(item.priority+d, id)
			}
		}
		heap.Init(&pq)
	}
	return shortests
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	// init
	n := nextInt(sc)
	dist := make([][]int, n)
	for i := 0; i < n; i++ {
		dist[i] = make([]int, n)
		for j := 0; j < n; j++ {
			dist[i][j] = -1
		}
	}

	// std Input
	for i := 0; i < n; i++ {
		u := nextInt(sc)
		k := nextInt(sc)
		for j := 0; j < k; j++ {
			v, c := nextInt(sc), nextInt(sc)
			dist[u][v] = c
		}
	}

	shortests := dikstra(dist, n)
	for i, d := range shortests {
		fmt.Printf("%d %d\n", i, d)
	}
}

C++: #include <iostream>
#include <climits>
#include <vector>
using namespace std;
typedef unsigned short ushort;
typedef vector <int> vi;
typedef vector <vi> vvi;

class blanch{
	public:
		bool visited;
		int distance;
		ushort from;
};
typedef vector <blanch> vb;

int make_graph(vvi &graph, vb &nodes){
	int n=graph.size();
	for (int i=0; i<n; i++){
		for (int j=0; j<n; j++){
			graph[i][j]=-1;
		}
		nodes[i].visited = false;
		nodes[i].distance = INT_MAX;
	}

	for (int i=0; i<n; i++){
		int i2,n2;
		cin>>i2;
		cin>>n2;
		for (int j=0; j<n2; j++){
			int j2;
			cin>>j2;
			cin>>graph[i2][j2];
		}
	}
	return 0;
}

int Shortest_Path(vvi &graph, vb &nodes){

	int n = graph.size(), p1=0;
	nodes[p1].distance = 0;

	while (p1 != -1){
		nodes[p1].visited=true;
for (int p2 = 0; p2 < n; p2++){
			int *tmp = &graph[p1][p2];
			if (*tmp!=-1 && nodes[p2].visited==false){
				int tmp2 = *tmp + nodes[p1].distance;
				if (tmp2 < nodes[p2].distance){
					nodes[p2].distance = tmp2;
					nodes[p2].from = p1;
				}
			}
		}

		p1 = -1;
		int tmp;
		tmp = INT_MAX;
		for (int i=0; i<n; i++){
			if (nodes[i].visited==false && nodes[i].distance<tmp){
				p1 = i;
				tmp = nodes[i].distance;
			}
		}
	}
	return 0;
}

int resultout(vb &nodes){
	int n = nodes.size();
	for (int i=0; i<n; i++){
		cout<<i<<" "<<nodes[i].distance<<endl;
	}
	return 0;
}

int main(void){

	int n;
	cin>>n;
	vvi G(n, vi(n));
	vb nodes(n);

	make_graph(G, nodes);

	Shortest_Path(G, nodes);

	resultout(nodes);

	return 0;
}

C++: #include<iostream>
#include<queue>
#include<vector>
#define MAX 10000
#define INFTY 1<<21
#define WHITE 0
#define GRAY 1
#define BLACK 2
using namespace std;

vector<pair<int, int> > adj[MAX];   // <頂点,重み>
priority_queue<pair<int, int> > PQ; // <重み,頂点> 正確には重み×-1
int d[MAX], color[MAX];
int n;

// ダイクストラのアルゴリズムに優先度付きキューを用いて、
// 最短経路上の各頂点まで道のりを求めて出力する。
void dijkstra()
{
	for (int i = 0; i < n; i++)
	{
		d[i] = INFTY;
		color[i] = WHITE;
	}

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

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

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

		color[u] = BLACK;

		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;
				PQ.push(make_pair(d[v] * (-1), v));
				color[v] = GRAY;
			}
		}
	}

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

int main()
{
	cin >> n;

	int k, u, v, c;
	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();

	return 0;
}

// 参考
// 本P310掲載の重み付き有向グラフの作成
void testSample()
{
	n = 7;
	adj[0].push_back(make_pair(1, 6));
	adj[0].push_back(make_pair(2, 12));
	adj[0].push_back(make_pair(3, 7));
	adj[2].push_back(make_pair(2, 8));
	adj[3].push_back(make_pair(4, 3));
	adj[3].push_back(make_pair(5, 53));
	adj[4].push_back(make_pair(3, 1));
	adj[4].push_back(make_pair(5, 0));
}

C++: #include<bits/stdc++.h>
#define d first
#define wgt first
#define to second

using namespace std;

typedef pair<int,int> pii;
typedef vector<pii> vec;
typedef vector<vec> Graph;

Graph G(11000);
int n,d[11000];

void Dijkstra()
{
	bool used[1100];
	priority_queue<pii,vector<pii>,greater<pii> > pq;
	fill(d,d+n,INT_MAX);
	memset(used,false,sizeof(used));
	pq.push(make_pair(0,0));
	while(!pq.empty())
	{
		pii u=pq.top();pq.pop();
		if(used[u.to]) continue;
		used[u.to]=true;
		d[u.to]=u.d;
		for(int i=0;i<G[u.to].size();i++)
			if(d[G[u.to][i].to]>d[u.to]+G[u.to][i].wgt)
			{
				d[G[u.to][i].to]=d[u.to]+G[u.to][i].wgt;
				pq.push(make_pair(d[G[u.to][i].to],G[u.to][i].to));
			}
	}
}

int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		int u,t;
		scanf("%d%d",&u,&t);
		for(int j=0;j<t;j++)
		{
			int v,w;
			scanf("%d%d",&v,&w);
			G[u].push_back(make_pair(w,v));
		}
	}
	Dijkstra();
	for(int i=0;i<n;i++)
		printf("%d %d\n",i,d[i]);
	return 0;
}

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

#define INF (1 << 30)

struct edge{

  int cost, to;

};

struct state{

  int node, cost;
  bool operator <(const state &b)const{
    return cost > b.cost;
  }
};

int n;
int d[10001];
vector<edge> glaph[10001];
priority_queue<state> qu;

void sss(){

  fill(d,d+10001,INF);
  qu.push((state){0,0});
  d[0] = 0;

  while(!qu.empty()){

    state info;
    info = qu.top();
    qu.pop();

    for(int i = 0; i < (double)glaph[info.node].size(); i++){
      if(d[glaph[info.node][i].to] > glaph[info.node][i].cost + d[info.node]){
      d[glaph[info.node][i].to] = glaph[info.node][i].cost + d[info.node];
      qu.push((state){glaph[info.node][i].to,d[info.node]}); 
      }
	}
  }

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



}

int main(){

  cin >> n;

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

  sss();


}