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 <vector>
#include <algorithm>
#include <queue>

using namespace std;

const int  MAXN = 15000; //本机运行时修改数值 
const int IFNTY = 1 << 20;


void show(pair<int, int> p);
void dijkstra(vector< pair<int, int> > adj_list[], int n, int u, int dis[]);

int main()
{

	vector< pair<int,int> > adj_list[MAXN];
	
	int n;
	cin >> n;
	
	int u, k, v, c;;	
	for (int i = 0; i < n; i++)
	{
		cin >> u >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> v >> c;
			adj_list[u].push_back(make_pair(v,c));
		}		
	}
	
//	for (int i = 0; i < n; i++)
//	{
//		cout << i << "   ";
//		for_each (adj_list[i].begin(), adj_list[i].end(), show);
//		cout << endl;
//	}

	
	int dis[MAXN];
	
	dijkstra(adj_list, n, 0, dis);
	
	for (int i = 0; i < n; i++)
	{
		cout << i << ' ' << dis[i] << endl;
	}

}


void show(pair<int, int> p)
{
	cout << p.first << ' ' << p.second << ' ';
}


void dijkstra(vector< pair<int, int> > adj_list[], int n, int u, int dis[])
{
	int visited[MAXN] = {0};
	priority_queue< pair<int, int> > pri_queue;
	
	for (int v = 0; v < n; v++)
 		dis[v] = IFNTY;
 		
	dis[u] = 0;
	pri_queue.push(pair<int, int>(0, u));
	
	while (!pri_queue.empty())
	{
		pair<int, int> p = pri_queue.top();
		pri_queue.pop();
		
		visited[p.second] = true;
		
		if (dis[p.second] < p.first * -1) continue; //如果是已经更新过的结点则跳过
		
		for (int i = 0; i < adj_list[p.second].size(); i++)
		{
			pair<int, int> v = adj_list[p.second][i];
//			if(visited[v.first]) continue;
			if (dis[v.first] > dis[p.second] + v.second)
			{
				dis[v.first] = dis[p.second] + v.second;
				pri_queue.push(pair<int, int>(dis[v.first] * -1, v.first));
			}
		} 
	} 
	
	
}

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

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


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

    d[0] = 0;
    PQ.push(make_pair(0, 0));
    color[0] = WHITE;
    
    while(!PQ.empty()){
        pair<int, int> f = PQ.top();
        PQ.pop();
        int u = f.second;
        color[u] = BLACK;
        
        // ????°??????????????????????????????§???????????°????????????
        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] == 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));
                color[v] = GRAY;
            }
        }
    }

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




int main() 
{
    ios::sync_with_stdio(false);
    
    cin >> n;
    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;
            adj[u].push_back(make_pair(v, c));
        }
    }
    
    dijkstra();
    
    return 0;
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

int x[1000][1000];
int y[1000];

int main() {
	memset(x, 1, sizeof(x));
	memset(y, 1, sizeof(y));
	int n, a, b, c, d;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		for (int i = 0; i < b; i++) {
			cin >> c >> d;
			x[a][c] = d;
		}
	}
	y[0] = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			for (int k = 0; k < n; k++) {
				y[k] = min(y[k], y[j] + x[j][k]);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		cout << i << ' ' << y[i] << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<queue>
#include<algorithm>
using namespace std;

static const int WHITE=0;
static const int GRAY=1;
static const int BLACK=2;
static const int MAX=10000;
static const int INFTY=(1<<20);

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

void dijkstra(){
  
  priority_queue<pair<int, int> > PQ;
  int i,j,u,color[MAX],d[MAX],v;
  
  for(i=0;i<n;i++){
   
    color[i]=WHITE;
    d[i]=INFTY;
  }
   color[0]=GRAY;
  d[0]=0;
  PQ.push(make_pair(0,0));
 

  while(!PQ.empty()){
    pair<int, int> f=PQ.top();  PQ.pop();
  
    u=f.second;
    color[u]=BLACK;
    
    if(d[u]<f.first*(-1))continue;

    for(j=0;j<adj[u].size();j++){
      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));
	color[v]=GRAY;

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

  }
  
}

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

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

    }
    
  }

  dijkstra();

  return 0;
}

C++: #include<iostream>
#include<cstdio>
#define INF 1<<30
#define FinishFunction return 0
#define MAX 1000000
using namespace std;
      
struct edge {
  int from,to,cost,k;
};
    
edge es[MAX];
    
int main(){
  int n,u,k,E,c,v;
  E = 0;
  scanf("%d",&n);
    
  for(int i=0;i<n;i++){
    scanf("%d %d",&u,&k);
       
    for(int j=0;j<k;j++){
      scanf("%d %d",&v,&c);
      es[E].from = u;
      es[E].to = v;
      es[E++].cost = c;
    }
  }
    
  // Ika berumanfo-do 
  int d[MAX];
  for(int i=0;i<n;i++)d[i] = INF;
  d[0] = 0;
  while(true){
    bool update = false;
    for(int i=0;i<E;i++){
      edge e = es[i];
      if(d[e.from] != INF && d[e.to] > d[e.from] + e.cost){
    d[e.to] = d[e.from] + e.cost;
    update = true;
      }
    }
    if(!update)break;
  }
  for(int i=0;i<n;i++)cout << i << " " << d[i] << endl;
  FinishFunction;// return 0
}