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<map>
#include<functional>
#include<cstring>
using namespace std;

int main(void){
	int n;
	while(1){
		scanf("%d",&n);
		if(n==0)break;
		multimap<int,int, greater<int> > s;
		for(int i=0;i<n;i++){
			int num,sc[10][3],sck[10],res=0;
			memset(sc,0,sizeof(sc));
			memset(sck,0,sizeof(sck));
			scanf("%d",&num);
			for(int j=0;j<10;j++){
				if(j<9)for(int k=0;k<2;k++){
					scanf("%d",&sc[j][k]);
					if(sc[j][k]==10)break;
				}
				if(j==9)for(int k=0;k<3;k++){
					scanf("%d",&sc[j][k]);
					if(k==1 && sc[j][0]+sc[j][1]<10)break;
				}
			}
			for(int j=0;j<9;j++){
				if(sc[j][0]==10){
					if(sc[j+1][0]==10 && j<=7)sck[j]=20+sc[j+2][0];
					else sck[j]=10+sc[j+1][0]+sc[j+1][1];
				}else if(sc[j][0]+sc[j][1]==10){
					sck[j]=10+sc[j+1][0];
				}else sck[j]=sc[j][0]+sc[j][1];
			}
			sck[9]=sc[9][0]+sc[9][1]+sc[9][2];
			for(int j=0;j<=9;j++)res+=sck[j];
			s.insert(make_pair(res,num));
		}
		multimap<int,int, greater<int> >::iterator it=s.begin();
		while(it!=s.end()){
			cout << (*it).second << " " << (*it).first << endl;
			it++;
		}
	}
    return 0;
}

C++: #include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<sstream>
#include<cstdlib>
using namespace std;
typedef pair<int,int> P; 
void split(vector<int>& vec,string line)
{
  stringstream ss;
  ss << line;
  for(int i=0;i<ss.str().size();i++)
    {
      string s;
      if((ss >>  s).fail())
	break;
      vec.push_back((atoi)(s.c_str()));
    }  
}

bool cmp(const P& a,const P& b)
{
  if(a.second != b.second)
    return a.second > b.second;
  return a.first < b.first;

}

int main()
{
  int n;
  while(cin >> n,n)
    {
      cin.ignore();
      vector<P> info;
      for(int i=0;i<n;i++)
	{
	  string line;
	  getline(cin,line);
	  vector<int> vec;
	  split(vec,line);

	  int total,cnt;
	  total = 0,cnt = 1;
	  for(int j=1;j<vec.size();cnt++)
	    {
	     
	      if(cnt != 10)
		{
		  if(vec[j] == 10)
		    {
		      total += 10;
		      total += vec[j+1]+vec[j+2];
		      j++;
		    }
		  else 
		    {
		      if(vec[j] + vec[j+1] == 10)
			{
			  total += 10+vec[j+2];
			}
		      else 
			{
			  total += vec[j]+vec[j+1]; 
		      
			}
		      j+=2;
		    }
		}
	      else
		{
		  if(vec[j]+vec[j+1] < 10)
		    {
		      total += vec[j]+vec[j+1];
		    }
		  else 
		    {
		      total += vec[j]+vec[j+1]+vec[j+2];
		    }

		  break;
		}

	    }
	  info.push_back(P(vec[0],total)); 

	}

      sort(info.begin(),info.end(),cmp);    
      for(int i=0;i<info.size();i++)
	cout << info[i].first << " " <<info[i].second << endl;

    }
  return 0;
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
int i,j,k;
int a,s[100],d[100][30],f,g[100],h,z[100][30],x[100][30],c,q[100];
int aa[100][30],ss;
int main(void)
{	
	while(1){
		f=0;
		h=0;
		c=0;
		ss=0;
		h=0;
		scanf("%d",&a);
		if(a==0) break;
		for(i=0;i<99;i++){
			s[i]=0;
			g[i]=0;
			q[i]=0;
			for(j=0;j<21;j++){
				d[i][j]=0;
				aa[i][j]=0;
				z[i][j]=0;
				x[i][j]=0;
			}
		}
		for(i=0;i<a;i++){
			f=18;
			g[i]=0;
			scanf("%d",&s[i]);
			while(1){
				scanf("%d",&d[i][g[i]]);
				if(d[i][g[i]]==10) f--;
				g[i]++;
				f--;
				if(f==0) break;
			}
			scanf("%d",&d[i][g[i]]);
			scanf("%d",&d[i][g[i]+1]);
			if(d[i][g[i]]==10||d[i][g[i]+1]==10||d[i][g[i]]+d[i][g[i]+1]==10){
				scanf("%d",&d[i][g[i]+2]);
				g[i]++;
			}
			g[i]+=2;
		}
		for(i=0;i<a;i++){
			j=0;
			c=0;
			while(1){
				if(d[i][j]==10){
					z[i][c]=2;
					x[i][c]=10;
					ss++;
					j++;
					aa[i][c]=j;
					c++;
				}
				else if(d[i][j]+d[i][j+1]==10){
					z[i][c]=1;
					x[i][c]=10;
					j=j+2;
					aa[i][c]=j;
					c++;
				}
				else if(d[i][j]+d[i][j+1]!=10){
					z[i][c]=0;
					x[i][c]=d[i][j]+d[i][j+1];
					j=j+2;
					aa[i][c]=j;
					c++;
				}
				else if(j=g[i]-1&&d[i][j]!=10){
					x[i][c]=d[i][j];
					z[i][c]=0;
					j++;
					aa[i][c]=j;
					c++;
				}
				if(j>=g[i])	break;
			}
		}
		for(i=0;i<a;i++){
			for(j=0;j<9;j++){
				q[i]+=x[i][j];
				if(z[i][j]==2){
					if(z[i][j+1]==2){
						if(z[i][j+2]==2)
							q[i]=q[i]+x[i][j+1]+x[i][j+2];
						else if(z[i][j+2]!=2)
							q[i]=q[i]+x[i][j+1]+d[i][aa[i][j+1]];
					}
					else if(z[i][j+1]!=2){
						q[i]+=x[i][j+1];
					}
				}
				else if(z[i][j]==1){
					q[i]+=d[i][aa[i][j]];
				}
			}
			q[i]=q[i]+x[i][9]+x[i][10]+x[i][11];
		}
		for(i=0;i<a;i++){
			for(j=i+1;j<a;j++){
				if(q[i]<q[j]){
					ss=q[i];
					q[i]=q[j];
					q[j]=ss;
					ss=s[i];
					s[i]=s[j];
					s[j]=ss;
				}
				else if(q[i]==q[j]){
					if(s[i]>s[j]){
					ss=q[i];
					q[i]=q[j];
					q[j]=ss;
					ss=s[i];
					s[i]=s[j];
					s[j]=ss;
					}
				}
			}
		}
		for(i=0;i<a;i++){
			printf("%d %d\n",s[i],q[i]);
		}
	}
	return 0;
}