Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

type entry struct {
	id, score int
}

type lessFunc func(p1, p2 *entry) bool

type multiSorter struct {
	entries []entry
	less    []lessFunc
}

func (ms *multiSorter) sort(entries []entry) {
	ms.entries = entries
	sort.Sort(ms)
}

func OrderedBy(less ...lessFunc) *multiSorter {
	return &multiSorter{
		less: less,
	}
}

func (ms *multiSorter) Len() int {
	return len(ms.entries)
}

func (ms *multiSorter) Swap(i, j int) {
	ms.entries[i], ms.entries[j] = ms.entries[j], ms.entries[i]
}

func (ms *multiSorter) Less(i, j int) bool {
	p, q := &ms.entries[i], &ms.entries[j]
	var k int
	for k = 0; k < len(ms.less)-1; k++ {
		less := ms.less[k]
		switch {
		case less(p, q):
			return true
		case less(q, p):
			return false
		}
	}
	return ms.less[k](p, q)
}

func main() {
	for scanner.Scan() {
		m, _ := strconv.Atoi(scanner.Text())
		if m == 0 {
			break
		}
		results := make([]entry, 0)
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			data := make([]int, len(buf))
			for i := range data {
				data[i], _ = strconv.Atoi(buf[i])
			}
			id, score := score(data)
			results = append(results, entry{id, score})
		}
		score_axis := func(e1, e2 *entry) bool {
			return e1.score > e2.score
		}
		id_axis := func(e1, e2 *entry) bool {
			return e1.id < e2.id
		}
		OrderedBy(score_axis, id_axis).sort(results)
		// log.Println(results)
		for _, e := range results {
			fmt.Printf("%d %d\n", e.id, e.score)
		}
	}
}

func score(input []int) (int, int) {
	id := input[0]
	data := input[1:]
	frame := 1
	scores := make([]int, 11)
	for frame <= 10 {
		if data[0] == 10 {
			scores[frame] = data[0] + data[1] + data[2]
			data = data[1:]
			frame += 1
		} else if data[0]+data[1] == 10 {
			scores[frame] = data[0] + data[1] + data[2]
			data = data[2:]
			frame += 1
		} else {
			scores[frame] = data[0] + data[1]
			data = data[2:]
			frame += 1
		}
	}
	sum := 0
	for i, v := range scores {
		if i != 0 {
			sum += v
		}
	}
	return id, sum
}

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

int getPoint() {
	int frames[12][2];
	for (int i = 0; i < 10; i++) {
		cin >> frames[i][0];
		if (frames[i][0] == 10) {
			frames[i][1] = 0;
		}
		else {
			cin >> frames[i][1];
		}
	}
	frames[11][0] = frames[11][1] = 0;
	if (frames[9][0] == 10) {
		cin >> frames[10][0];
		if (frames[10][0] == 10) {
			frames[10][1] = 0;
			cin >> frames[11][0];
		}
		else {
			cin >> frames[10][1];
		}
	}
	else if (frames[9][0] + frames[9][1] == 10) {
		cin >> frames[10][0];
		frames[10][1] = 0;
	}
	
	int result = 0;
	for (int i = 0; i < 10; i++) {
		result += frames[i][0] + frames[i][1];
		if (frames[i][0] + frames[i][1] == 10) {
			result += frames[i + 1][0];
			if (frames[i][0] == 10) {
				if (frames[i + 1][0] == 10) {
					result += frames[i + 2][0];
				}
				else {
					result += frames[i + 1][1];
				}
			}
		}
	}
	return result;
}

int main () {
	int m;
	while (cin >> m, m) {
		pair<int, int> results[m];
		for (int i = 0; i < m; i++) {
			cin >> results[i].second;
			results[i].first = -getPoint();
		}
		sort(results, results + m);
		for (int i = 0; i < m; i++) {
			cout << results[i].second << ' ' << -results[i].first << endl;
		}
	}
	return 0;
}

C++: // Tazoe

#include <iostream>
#include <string>
#include <sstream>
using namespace std;

int main()
{
	while(true){
		string S;
		getline(cin, S);
		istringstream ist(S);

		int m;
		ist >> m;

		if(m==0)
			break;

		int N[40], P[40];
		for(int i=0; i<m; i++){
			getline(cin, S);
			istringstream ist(S);

			ist >> N[i];

			int p[21];
			for(int j=0; j<21; j++){
				ist >> p[j];

				if(ist.eof())
					break;
			}

			P[i] = 0;
			int k = 0;
			for(int j=0; j<9; j++){
				P[i] += p[k];
				if(p[k]==10){
					P[i] += (p[k+1]+p[k+2]);
					k++;
					continue;
				}

				P[i] += p[k+1];
				if(p[k]+p[k+1]==10){
					P[i] += p[k+2];
				}
				k += 2;
			}

			P[i] += (p[k]+p[k+1]);
			if(p[k]==10||p[k]+p[k+1]==10){
				P[i] += p[k+2];
			}
		}

		for(int i=0; i<m-1; i++){
			for(int j=i+1; j<m; j++){
				if(P[i]<P[j]||(P[i]==P[j]&&N[i]>N[j])){
					int tmp = N[i];
					N[i] = N[j];
					N[j] = tmp;

					tmp = P[i];
					P[i] = P[j];
					P[j] = tmp;
				}
			}
		}

		for(int i=0; i<m; i++){
			cout << N[i] << ' ' << P[i] << '\n';
		}
	}

	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int, int>P;

int s[10][5];

P operator+(P a, int d) {
	rep(i, d) {
		if (~s[a.first][a.second + 1])a.second++;
		else {
			a.first++; a.second = 0;
		}
	}
	return a;
}
int main() {
	int m;
	while (scanf("%d", &m), m) {
		vector<P>v;
		rep(i, m) {
			memset(s, -1, sizeof(s));
			int id; scanf("%d", &id);
			int f = 0; bool b = 0;
			while (f < 9) {
				scanf("%d", &s[f][b]);
				if (b&&s[f][b] == 10)abort();
				//if (s[f][b] > 10)abort();
				if (s[f][b] == 10)f++;
				else {
					if (b)f++;
					b = !b;
				}
			}
			scanf("%d%d", &s[9][0], &s[9][1]);
			if (s[9][0] + s[9][1] >= 10)scanf("%d", &s[9][2]);
			P p(0, 0);
			while (p.first < 9) {
				if (s[p.first][p.second] == 10) {
					P a = p + 1, b = p + 2;
					s[p.first][p.second] += s[a.first][a.second] + s[b.first][b.second];
				}
				if (p.second&& s[p.first][p.second - 1] + s[p.first][p.second] == 10) {
					P a = p + 1;
					s[p.first][p.second] += s[a.first][a.second];
				}
				p = p + 1;
			}
			int cnt = 0;
			rep(i, 10)rep(j, 3) {
				if (~s[i][j])cnt += s[i][j];
			}
			v.push_back(P(cnt, id));
		}
		sort(v.begin(), v.end(), [](P a, P b) {
			if (a.first != b.first)return a.first > b.first;
			return a.second < b.second;
		});
		for (auto p : v) {
			printf("%d %d\n", p.second, p.first);
		}
	}
}