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<climits>
using namespace std;

typedef struct{
  int A[10005];
  long long ans;
  bool c;
}node;
node T[10005];
int Q[100000000];
int head=0;
int tail=1;
int n;

void function(int num){
  while(true){
    if(head==tail)break;
    num=Q[head++];
    if(head==99999999)head=1;
    T[num].c=true;
    for(int i=0;i<n;i++){
      if(T[num].A[i]!=0){
	if(T[i].ans>T[num].ans+T[num].A[i]){
	  T[i].ans=T[num].ans+T[num].A[i];
	Q[tail++]=i;
	if(tail==99999999)tail=1;
	}
      }
    }
  }
}

int main(){
  int num,son,z,w;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>num>>son;
    T[num].ans=LONG_LONG_MAX;
    for(int j=0;j<son;j++){
      cin>>z>>w;
      T[num].A[z]=w;
      }
  }
  Q[0]=0;
  T[0].ans=0;
  function(0);
 
  for(int i=0;i<n;i++){
      cout<<i<<" "<<T[i].ans<<endl;
  }
  return 0;
}

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

int main()
{
	int n, u, k, v1, c1;
	const int INF = 1000000;
	
	cin >> n;
	
	vector<vector<int> > v(n), c(n);
	vector<int> w(n, INF);
	typedef pair<int, int> wt;
	priority_queue<wt, vector<wt>, greater<wt>> que;

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

	w[0] = 0;
	que.push(wt(0, 0));

	while (!que.empty()) {
		wt g = que.top();
		que.pop();

		int k = g.second;

		if (w[k] < g.first)
			continue;

		for (int i = 0; i < (int)v[k].size(); i++) {
			if (w[v[k][i]] > w[k] + c[k][i]) {
				w[v[k][i]] = w[k] + c[k][i];
				que.push(wt(w[v[k][i]], v[k][i]));
			}
		}
	}

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

	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (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 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();
		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, 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++: #define ll long long
#define MAX 10000

#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
static const int INF = (1 << 21);

int n;
priority_queue<pair<int,int>> PQ;
vector<pair<int, int>> adj[MAX];
int color[MAX];
int d[MAX];

void dj(int s){
	for (int i = 0;i < n;i++) {
		d[i]=INF;
		color[i] = 0;
	}
	
	d[s] = 0;
	PQ.push(make_pair(0, 0));
	color[0] = 1;

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

		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] == 2) 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] = 1;
			}
		}
	}

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

}

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

	dj(0);

}

C++: #include <stdio.h>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <math.h>
#include <queue>
#include <string.h>
#include <map>
#include <set>
#include <cstdlib>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

char ToUpper(char cX) { return toupper(cX); }
char Tolower(char cX) { return tolower(cX); }

const long long INF = 1LL << 60;
const long long MOD = 1000000007;

using namespace std;
typedef unsigned long long ull;
typedef  long long ll;



vector<vector<ll>> dp;


vector<ll> d;

//sスタート
void dikstra(ll n, vector<vector<pair<ll, ll>>> &adj) {
	ll s = 0; //start
	priority_queue<pair<ll, ll>> PQ;
	vector<ll> color(n, 0);
	d = vector<ll>(n, INF);
	d[s] = 0;
	/*(-distance  ,position)*/
	PQ.push(make_pair(0, s));
	color[s] = 1;
	while (!PQ.empty()) {
		pair<ll, ll> f = PQ.top();
		PQ.pop();
		ll u = f.second;
		color[u] = 2;
		if (d[u] < f.first*(-1))
			continue;
		for (ll j = 0; j < adj[u].size(); j++) {
			ll v = adj[u][j].first;
			if (color[v] == 2)
				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] = 1;
			}
		}
	}
}


int main()
{
	ll n;
	cin >> n;
	vector <vector<pair<ll, ll>>> adj;
	adj.resize(n);
	for (ll i = 0; i < n; i++) {
		ll u, k, v, c;
		cin >> u >> k;
		adj[u].resize(k);
		for (ll j = 0; j < k; j++) {
			cin >> adj[u][j].first >> adj[u][j].second;
		}
	}
	dikstra(n, adj);

	for (ll i = 0; i < d.size(); i++) {
		cout << i << " " << d[i] << endl;
	}

	return 0;
}