Go: package main

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

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 <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define fi first
#define sec second
#define pb push_back
int hit[25],frame[25];
bool spare[25],strike[25];
int game(){
	memset(hit,0,sizeof(hit));
	memset(frame,-1,sizeof(frame));
	memset(spare,false,sizeof(spare));
	memset(strike,false,sizeof(strike));
	int cur = 0;
	for(int i=1;i<=9;i++){
		scanf("%d",&hit[cur]);
		frame[cur]=i;
		cur++;
		if(hit[cur-1]==10){
			strike[cur-1]=true;
			continue;
		}
		scanf("%d",&hit[cur]);
		frame[cur]=i;
		if(hit[cur]+hit[cur-1]==10)spare[cur]=true;
		cur++;
	}
	for(int i=10;i<=10;i++){
		scanf("%d",&hit[cur]);
		frame[cur]=i;
		cur++;
		scanf("%d",&hit[cur]);
		frame[cur]=i;
		cur++;
		if(hit[cur-1]+hit[cur-2]<10)break;
		scanf("%d",&hit[cur]);
		frame[cur]=i;
		cur++;
	}
	int ret = 0;
	for(int i=0;i<cur;i++){
		ret += hit[i];
		if(strike[i]){
			ret += hit[i+1];
			ret += hit[i+2];
		}
		if(spare[i])ret += hit[i+1];
	}
	return ret;
}
int main(){
	int m;
	while(1){
		scanf("%d",&m);
		if(m==0)break;
		vector<P> vec;
		for(int i=0;i<m;i++){
			int id;
			scanf("%d",&id);
			int score = game();
			vec.pb(P(-score,id));
		}
		sort(vec.begin(),vec.end());
		for(int i=0;i<vec.size();i++){
			printf("%d %d\n",vec[i].sec,-vec[i].fi);
		}
	}
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

void input(vector<vint>& v)
{
	rep(i, 10)
	{
		int f;
		cin >> f;
		
		v[i][0] = f;
		
		// 2Úª éê
		if(f != 10 || i == 9)
		{
			int s;
			cin >> s;
			
			v[i][1] = s;
		}
	}
	
	// 10t[ÚÌÅãÌ
	if(v[9][0] + v[9][1] == 10 || v[9][1] == 10)
	{
		int l;
		cin >> l;
		
		v[9][2] = l;
	}
}

int search(vector<vint>& v, int I, int c)
{
	int res = 0;
	REP(i, I, 10) rep(k, 2)
		if(v[i][k] != -1 && 0 < c--) res += v[i][k];
	
	return res;
}

int calc(vector<vint> v)
{
	// Åã©çßÄ¢­
	// 10t[ÚÌÝÊ

	int res = v[9][0] + v[9][1] + (v[9][2] != -1 ? v[9][2] : 0);
	
	rep(i, 9)
	{
		if(v[i][0] == 10)
		{
			res += 10 + search(v, i + 1, 2);
		}
		else if(v[i][0] + v[i][1] == 10)
		{
			res += 10 + search(v, i + 1, 1);
		}
		else res += v[i][0] + v[i][1];
	}
	
	return res;
}

bool pred(pint a, pint b)
{
	return a.first > b.first || (a.first == b.first && a.second < b.second);
}

int main()
{
    int n;
	while(cin >> n && n)
	{
		vector<pint> pnt(n);
		
		rep(i, n)
		{
			cin >> pnt[i].second;

			vector<vint> v(10, vint(3, -1));
			
			// üÍðó¯æé
			input(v);
			
			// ¾_ðvZ·é
			pnt[i].first = calc(v);
		}
		
		// å«¢Å\[g
		sort(ALL(pnt), pred);
		
		rep(i, n)
			cout << pnt[i].second << " " << pnt[i].first << endl;
	}
}

C++: #include<iostream>
using namespace std;
int main(){
long n,i,j,s[40],p[21],q[40],t;
while(cin>>n,n){
for(i=0;i<n;i++){
cin>>s[i];
q[i]=0;
for(j=0;j<20;j++){
cin>>p[j];
q[i]+=p[j];
if(j<18&&j%2==0&&p[j]==10){j++;p[j]=0;}
}
if(p[18]==10||p[18]+p[19]==10){cin>>p[20];q[i]+=p[j];}
for(j=0;j<18;j+=2){
if(p[j]==10){
if(p[j+2]==10)q[i]+=p[j+2]+p[j+4];
else q[i]+=p[j+2]+p[j+3];
}else if(p[j]+p[j+1]==10){
q[i]+=p[j+2];
}
}
}
for(i=n-1;i>=1;i--){
for(j=0;j<i;j++){
if(q[j]<q[j+1]||q[j]==q[j+1]&&s[j]>s[j+1]){
t=q[j];q[j]=q[j+1];q[j+1]=t;
t=s[j];s[j]=s[j+1];s[j+1]=t;
}
}
}
for(i=0;i<n;i++){
cout<<s[i]<<" "<<q[i]<<endl;
}
}
return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
 
 int main() {
 int da[25],sc[41],i,j,k,n,fr;
 char ch[100];
 while(cin >> n) {
	 if (n==0) break;
	 cin.ignore();
	 for (j=0;j<n;j++) {
     gets(ch); k=fr=sc[j]=0; 
     for (i=0;i<25;i++) da[i]=0;
     for (i=0;ch[i]!='\0';i++) if (ch[i]>='0' && ch[i]<='9') da[k]=da[k]*10+ch[i]-'0'; else k++;
	 k++; i=fr=1; sc[j]=0;
	 for (fr=1;fr<10;fr++) {
		 if (da[i]==10) {sc[j]+=10+da[i+1]+da[i+2]; i++;} else {
		 if (da[i]+da[i+1]==10) sc[j]+=10+da[i+2]; else sc[j]+=da[i]+da[i+1];
		 i+=2;} }
	 sc[j]=(sc[j]+da[i]+da[i+1]+da[i+2])*10000+da[0];
	 }
     sort(sc,sc+n);
     for (i=n-1;i>=0;i--) cout << sc[i] % 10000 << ' ' << sc[i]/10000 << endl;
 }
 re