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

using namespace std;

const int maxn=10000;
const int inf=(1<<20);

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

void Dijkstra(){
    priority_queue<pair<int,int> > PQ;
 //   int color[maxn];
    bool vis[maxn];
    int d[maxn];
    for(int i=0;i<n;i++){
        d[i]=inf;
     //   color[i]=white;
        vis[i]=false;
    }

    d[0]=0;
    PQ.push(make_pair(0,0));
 //   color[0]=gray;
  //  vis[0]=1;

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

      //  color[u]=black;
        vis[u]=true;

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

        for(int j=0;j<adj[u].size();j++){
            int v=adj[u][j].first;
            if(vis[v]==true) continue;
            if(d[v]>d[u]+adj[u][j].second){
                d[v]=d[u]+adj[u][j].second;
    // priority_queue priority_queue 默认优先较大值， 因此要乘以-1。
                PQ.push(make_pair(d[v]*(-1),v));
              //  vis[v]=true;这句不能加
              //  color[v]=gray;
            }
        }
    }

    for(int i=0;i<n;i++){
        printf("%d %d\n",i,(d[i]==inf?-1: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));
        }
    }

    Dijkstra();

    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<20);
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;
      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 k,u,v,c;
  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 <vector>
#include <queue>
const int MAX_N = 10000;
const int INF = 999999999;
const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;
using namespace std;

int n;
vector<pair<int, int> > adj[MAX_N];
int color[MAX_N];
int d[MAX_N];

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

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

    while (!PQ.empty()) {
        pair<int, int> edge = PQ.top(); PQ.pop();
        int u = edge.second;
        color[u] = BLACK;

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

        for (int i = 0; i < adj[u].size(); i++) {
            int v = adj[u][i].first;
            if (color[v] == BLACK) continue;
            if (d[v] > d[u] + adj[u][i].second) {
                d[v] = d[u] + adj[u][i].second;
                PQ.push(make_pair(d[v]*-1, v));
                color[v] = GRAY;
            }
        }

    }
}

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

    dijkstra(0);

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

    return 0;
}

C++: #include<stdio.h>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>

typedef long long int ll;

#define BIG_NUM 2000000000

using namespace std;

struct Node {
    Node(int arg_to, int arg_cost) {
        to = arg_to;
        cost = arg_cost;
    }
    
    bool operator<(const struct Node &arg) const{
        return cost > arg.cost;
    };
    
    int to, cost;
};

int main() {
    int N;
    scanf("%d", &N);
    
    vector<Node> V[N];
    
    int node, num, to, cost, D[N];
    
    for(int loop = 0; loop < N; loop++) {
        scanf("%d", &node);
        scanf("%d", &num);
        
        for(int i = 0; i < num; i++) {
            scanf("%d %d", &to, &cost);
            V[node].push_back(Node(to, cost));
        }
        D[loop] = BIG_NUM;
    }
    
    D[0] = 0;
    
    priority_queue<Node> Q;
    
    for(int i = 0; i < V[0].size(); i++) {
        D[V[0][i].to] = V[0][i].cost;
        Q.push(Node(V[0][i].to, V[0][i].cost));
    }
    
    int min_index;
    
    while(!Q.empty()) {
        if(Q.top().cost == D[Q.top().to]) {
            min_index = Q.top().to;
            Q.pop();
        }else {
            Q.pop();
            continue;
        }
        
        for(int k = 0; k < V[min_index].size(); k++) {
            if(D[V[min_index][k].to] > D[min_index] + V[min_index][k].cost) {
                D[V[min_index][k].to] = D[min_index] + V[min_index][k].cost;
                Q.push(Node(V[min_index][k].to, D[V[min_index][k].to]));
            }
        }
    }
    
    for(int i = 0; i < N; i++) printf("%d %d\n", i, D[i]);
    
    return 0;
}