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
	heap.Init(&pq)

	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 <bits/stdc++.h>
using namespace std;
#define MAX 10000
#define INFTY (1<<20)
#define WHITE 0
#define GRAY 1
#define BLACK 2

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

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

  d[0] = 0;
  PQ.push(make_pair(0,0));
  color[0] = GRAY;
  while ( !PQ.empty() ) {
    pair<int, int> f = PQ.top(); PQ.pop();//(cost, Nodeid)
    int u = f.second;
    color[u] = BLACK;
    if( d[u] < f.first * ( -1 ))continue;//今の最小Nodeよりコストが大きいなら再計算はしない
    for (int j = 0; j < adj[u].size(); j++) {
      int v = adj[u][j].first;
      if (color[v] == BLACK) 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));//STL priority_queueはmaximum
        color[v] = GRAY;
      }
    }
  }
  for (int i =0; i< n; i++) {
    cout << i << " " << ( d[i] == INFTY ? -1 : d[i]) << endl;
  }
}

int main(){

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

  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
using namespace std;
const int INF = 1 << 30;
const int NIL = -1;
const int MAXN = 10005;
int vis[MAXN];
int d[MAXN];
int head[500005];
int n;
int cnt;
struct Edge {
	int to, next, w;
	Edge() {}
} edge[500005];

void add(int u, int v, int w)
{
	edge[cnt].to = v;
	edge[cnt].w = w;
	edge[cnt].next = head[u];
	head[u] = cnt++;
}

struct Node {
	int u, w;
	Node (int _u, int _w) :u(_u), w(_w) {}
	friend bool operator<(const Node& a, const Node& b)
	{
		return a.w > b.w;
	}
};

void dijkstra(int s)
{
	priority_queue<Node> q;
	for (int i = 0; i < n; ++i)
		d[i] = INF, vis[i] = false;
	d[s] = 0;
	
	Node t(s, 0);
	q.push(t);
	int u, v, w;
	int count = 0;
	while (!q.empty() && count < n - 1)
	{
		t = q.top();
		q.pop();
		u = t.u;
		if (d[u] < t.w)
			continue;
		vis[u] = true;
		++count;
		for (int i = head[u]; i != NIL; i = edge[i].next)
		{
			v = edge[i].to;
			w = edge[i].w;
			if (!vis[v] && d[v] > d[u] + w)
			{
				d[v] = d[u] + w;
				q.push(Node(v, d[v]));
			}
		}
	}
	if (count == n - 1)
		for (int i = 0; i < n; ++i)
			cout << i << " " << d[i] << endl;

}

int main(void)
{cin.tie(0);
	ios::sync_with_stdio(false);
	int k, s, e, w;
	cin >> n;
	memset(head, NIL, sizeof(-1));
	cnt = 0;
	for (int i = 0; i < n; ++i)
	{
		cin >> s >> k;
		while (k--)
		{
			cin >> e >> w;
			add(s, e, w);
		}
	}
	dijkstra(0);

	return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <list>
#include <vector>

class TNode
{
	std::list<std::pair<TNode*, int> > FNexts;
	int  FDistance;
public:
	TNode()
	: FDistance(-1)
	{
	}
	
	int GetDistance()const {return FDistance;}
	void SetDistance(int Distance){FDistance = Distance;}
	
	void Push(TNode* New, int Weight)
	{
		FNexts.push_back(std::make_pair(New, Weight));
	}
	
	void Visit()
	{
		std::cout << "Visited" << std::endl		for(std::list<std::pair<TNode*, int> >::iterator It = FNexts.begin(); It != FNexts.end(); ++It){
			int NextDistance = It->first->GetDistance();
			if(NextDistance >= 0 && NextDistance < FDistance + It->second) continue;
			It->first->SetDistance(FDistance + It->second);
		}
	}
};

class TGraph
{
	std::vector<TNode*> FNodes;
	std::list<TNode*> FSearchList;
	
	std::list<TNode*>::iterator FindMinimum()
	{
		std::list<TNode*>::iterator Result = FSearchList.begin();
		int Distance = (*Result)->GetDistance();
		for(std::list<TNode*>::iterator It = FSearchList.begin(); It != FSearchList.end(); ++It){
			int TempDistance = (*It)->GetDistance();
			if(Distance < 0 || TempDistance >= 0 && TempDistance < Distance){
				Result = It;
				Distance = TempDistance;
			}
		}
		return Result;
	}
public:
	TGraph(int Count)
	: FNodes(Count)
	{
		for(int i = 0; i < Count; ++i){
			FNodes[i] = new TNode();
			FSearchList.push_back(FNodes[i]);
		}
		FNodes[0]->SetDistance(0);
	}
	
	~TGraph()
	{
		for(unsigned int i = 0; i < FNodes.size(); ++i){
			delete FNodes[i];
		}
	}
	
	void InputNode()
	{
		int Index;
		std::cin >> Index;
		int BranchCount;
		std::cin >> BranchCount;
		for(int i = 0; i < BranchCount; ++i){
			int Target, Weight;
			std::cin >> Target >> Weight;
			FNodes[Index]->Push(FNodes[Target], Weight);
		}
	}
	
	void DijkstraSearch()
	{
		while(!FSearchList.empty()){
			std::list<TNode*>::iterator It = FindMinimum();
			TNode* Minimum = *It;
			FSearchList.erase(It);
			Minimum->Visit();
		}
	}
	
	int Distance(int Target)const
	{
		return FNodes[Target]->GetDistance();
	}
};

int main()
{
	int Count;
	std::cin >> Count;
	TGraph Graph(Count);
	for(int i = 0; i < Count; ++i){
		Graph.InputNode();
	}
	Graph.DijkstraSearch();
	
	for(int i = 0; i < Count; ++i){
		std::cout << i << " " << Graph.Distance(i) << std::endl;
	}
	return 0;
}