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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int calc()
{
	int ret=0;
	vector<int>ok;
	for(int i=0;i<9;i++)
	{
		int a;cin>>a;
		ret+=a;
		for(int&j:ok)
		{
			if(j-->0)ret+=a;
		}
		if(a==10)
		{
			ok.push_back(2);
			continue;
		}
		int b;cin>>b;
		ret+=b;
		for(int&j:ok)
		{
			if(j-->0)ret+=b;
		}
		if(a+b==10)
		{
			ok.push_back(1);
		}
	}
	int a,b;cin>>a>>b;
	ret+=a+b;
	for(int&j:ok)
	{
		if(j-->0)ret+=a;
		if(j-->0)ret+=b;
	}
	if(a+b>=10)
	{
		int c;cin>>c;ret+=c;
	}
	return ret;
}
main()
{
	int N;
	while(cin>>N,N)
	{
		vector<pair<int,int> >P;
		for(int i=0;i<N;i++)
		{
			int id;cin>>id;
			int p=calc();
			P.push_back(make_pair(-p,id));
		}
		sort(P.begin(),P.end());
		for(pair<int,int>p:P)cout<<p.second<<" "<<-p.first<<endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void)
{
	int i,j,k,m,score[41][21],id[41],x,cnt,yoso[41]={0},sum[41]={0},flg[41][21],p,check[41]={0};
	
	while(cin>>m&&m) {
		for(i=0;i<m;i++) yoso[i]=sum[i]=check[i]=0;
		for(i=0;i<m;i++) {
			cnt=21;
			cin>>id[i];
			x=p=0;
			for(j=0;j<21;j++) flg[i][j]=-1;
			while(cnt>0) {
				cin>>score[i][x];
				if(cnt<=3) {
					if(score[i][x]==10) cnt--,flg[i][x]=2;
					else if(cnt==1&&score[i][x]+score[i][x-1]==10) flg[i][x]=flg[i][x-1]=1;
					else cnt-=2,flg[i][x]=0;
				}	
				else {
					if(score[i][x]==10) cnt-=2,flg[i][x]=2;
					else if(p==1&&score[i][x]+score[i][x-1]==10) flg[i][x]=flg[i][x-1]=1,p=0,cnt--;
					else if(p==1) cnt--,flg[i][x]=0,p=0;
					else cnt--,flg[i][x]=0,p=1;
				}
				x++;
			}
			yoso[i]=x;
		}
		int a;
		for(i=0;i<m;i++) {
			a=0;
			for(j=0;j<yoso[i];j++) {
				if(a!=9) {
					if(flg[i][j]!=2) j++,a++;
					else a++;
				}
				else check[i]++;
			}
		}
		for(i=0;i<m;i++) {
			for(j=0;j<yoso[i];j++) {
				if(j<yoso[i]-check[i]) {
					if(flg[i][j]==0) sum[i]+=score[i][j]+score[i][j+1],j++;
					else if(flg[i][j]==1) {
						sum[i]+=score[i][j]+score[i][j+1]+score[i][j+2];
						j++;
					}
					else sum[i]+=score[i][j]+score[i][j+1]+score[i][j+2];
				}
				else {
					if(check[i]==3) sum[i]+=score[i][j]+score[i][j+1]+score[i][j+2];
					else sum[i]+=score[i][j]+score[i][j+1];
					break;
				}
			}
		}
		for(i=0;i<m-1;i++) {
			for(j=i+1;j<m;j++) {
				if(sum[i]<sum[j]) swap(sum[i],sum[j]),swap(id[i],id[j]);
				if(sum[i]==sum[j]&&id[i]>id[j]) swap(id[i],id[j]); 
			}
		}
		for(i=0;i<m;i++) cout<<id[i]<<" "<<sum[i]<<endl;
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

class StudentInfo {
public:
	int id, score;

	StudentInfo():score(0) {
	}
};

StudentInfo StuData[40];
int ScoreOfSet[21];

int calculation(int n) {
	int i, sum, cnt;

	i = sum = cnt = 0;
	while (cnt!=10)
	{
		//cout << "start:" << i;
		if (ScoreOfSet[i] == 10) {
			sum += 10 + ScoreOfSet[i + 1] + ScoreOfSet[i + 2];
			i++;
		}
		else if (ScoreOfSet[i] + ScoreOfSet[i+1] == 10) {
			sum += 10 + ScoreOfSet[i + 2];
			i += 2;
		}
		else {
			sum += ScoreOfSet[i] + ScoreOfSet[i + 1];
			i += 2;
		}
		//cout <<"   sum=" << sum << endl;
		cnt++;
	}
	return sum;
}



bool cmp(const StudentInfo &stu1, const StudentInfo &stu2) {
	if (stu1.score == stu2.score) {
		return stu1.id < stu2.id;
	}
	return stu1.score > stu2.score;
}

int main() {
	int n,j;
	string str;
	stringstream ss;

	while (cin >> n, n) {
		getchar();
		memset(ScoreOfSet, 0, sizeof(ScoreOfSet));
	
		for (int i = 0; i < n; i++) {
			j = 0;
			getline(cin, str);
			ss << str;
			ss >> StuData[i].id;
			while (ss) {
				ss >> ScoreOfSet[j++];
			}
			j--;
			StuData[i].score = calculation(j);
			ss.clear();
			str = "";
		}
		sort(StuData, StuData + n, cmp);
		
		for (int i = 0; i < n; i++) {
			cout << StuData[i].id << " " << StuData[i].score << endl;
		}
	}

	return 0;
}