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 <iostream>
#include <algorithm>
#include <queue>
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 color[MAX], d[MAX];
  for ( int i = 0; i < n; i++ ) {
    color[i] = WHITE;
    d[i] = INFTY;
  }

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

  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] == INFTY ? -1 : d[i] ) << endl;
  }
}


int main() {
  int u, k, c, 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 <bits/stdc++.h>
using namespace std;
static const int INFTY = 2000000000;
static const int NIL = -1;
static const int MAX = 10000;
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] = 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();
        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;
                //priority_queue???DEFAULT??§??§?????????????????????????????????-1??????????????????
                PQ.push(make_pair(d[v] * (-1),v));
                color[v] = GRAY;
            }
        }
    }

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

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

    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);
            adj[u].push_back(make_pair(v,c));
        }
    }
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <climits>
#include <map>
using namespace std;

const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;

int n;
vector<vector<pair<int,int>>> G;
vector<int> d;
multimap<int,int> pri_m;
vector<int> colors;

//失败了，怀疑是因为相同的cost的情况覆盖了...
void dijkstra(int s){
    d[s] = 0;
    pri_m.insert(make_pair(0,s));

    while(!pri_m.empty()){
        int cost = pri_m.begin()->first;
        int u = pri_m.begin()->second;
        //pri_m.erase(cost);
        map<int,int>::iterator it=pri_m.find(cost);//删除(c,5)
        pair<map<int,int>::iterator,map<int,int>::iterator> pos=pri_m.equal_range(it->first);//利用一对multimap<string,int>指向第一个出现(c,5)的位置和最后一个出现(c,5)的位置
        while (pos.first!=pos.second)
        {
            if (pos.first->second==u)//当pos指向5时
            {
                pos.first=pri_m.erase(pos.first);//删除后会改变pos迭代器，故赋值给自身，指向删除后的下一个键值对
            }
            else
                ++pos.first;//不进行删除操作则自增

        }
        if(d[u] < cost) continue;
        colors[u] = BLACK;
        for(int i = 0;i<G[u].size();i++){
            int v = G[u][i].first;
            if(colors[v] != BLACK){
                if(d[u]+G[u][i].second < d[v]){
                    d[v] = d[u]+G[u][i].second;
                    pri_m.insert(make_pair(d[v],v));
                }
            }
        }
    }
    for(int i=0;i<n;i++) printf("%d %d\n",i,d[i]);
}

int main(){
    //freopen("data.txt","r",stdin);
    cin >> n;
    G.resize(n);
    d.resize(n,INT_MAX);
    colors.resize(n,WHITE);
    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;
            G[u].push_back(make_pair(v,c));
        }
    }
    dijkstra(0);

    return 0;
}