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;

int main(void){
    // Your code here!
    while (true){
    int n,d=1,u=1,m=0,t=0,a,b;
    cin >> n;
    if (n==0) break;
    vector<int> id(n),s(n),dd(100);
    for (int i=0;i<100;i++){
        dd.at(i)=1;
    }
    for (int i=0;i<n;i++){
        cin >> id.at(i);
        t=0;u=1;m=0;d+=2;
        while (true){
            if (u<10){
            cin >> a;
            t=t+a;
            if (m==0 && t<10) {m++;d++;continue;}
            else if (t<10) {s.at(i)+=(t-a)*dd.at(d-1);s.at(i)+=a*dd.at(d);d++;t=0;u++;m=0;}
            else if (m==0 && t==10) {s.at(i)+=t*dd.at(d);dd.at(d+1)++;dd.at(d+2)++;t=0;u++;m=0;d++;}
            else {s.at(i)+=(t-a)*dd.at(d-1);s.at(i)+=a*dd.at(d);dd.at(d+1)++;t=0;u++;m=0;d++;}
            }
            if (u==10){
                cin >> a >> b;
                if (a+b>=10) {s.at(i)+=a*dd.at(d);s.at(i)+=b*dd.at(d+1);cin >> a;s.at(i)+=a;}
                else {s.at(i)+=a*dd.at(d);s.at(i)+=b*dd.at(d);}
                break;
            }
        }
    }
    vector<pair<int,int>> v(n);
    for (int i=0;i<n;i++){
        v.at(i).second=s.at(i);
        v.at(i).first=id.at(i);
    }
    sort(v.begin(),v.end(), [&](const pair<int, int>& x, const pair<int, int>& y) {
			if (x.second == y.second) {
				return x.first < y.first;
			}
			return x.second > y.second;
		});
    for (int i=0;i<n;i++) {
			cout << v[i].first << " " << v[i].second << endl;
		}
}
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	while(1){
	int s[14]={0},pr[14]={0},m,temp=0,count = 0;
	int p[14][4]={0},score[10]={0},score1[10]={0};
	double n[10]={0},n1[10]={0};
	cin >> m;
	if(m==0) return 0;
	for(int i=0;i<m;i++){
		cin >> n[i];
		for(int l=0;l<9;l++){
			for(int k=0;k<2;k++){
				cin >> p[l][k];
				temp+=p[l][k];
				if(k==0&&temp==10){
					s[l] = 1;
					break;
				}else if(k==1&&temp==10){
					pr[l] = 1;
				}else if(k==1&&temp<10){
				}
			}
			temp = 0;
		}
		cin >> p[9][0];
			if(p[9][0] == 10){
				cin >> p[9][1] >> p[9][2];
				score[i]+= 10 + p[9][1] +p[9][2];
			}else{
				cin >> p[9][1];
				if(p[9][0]+p[9][1]==10){
					cin >> p[9][2];
					score[i]+= 10 + p[9][2];
				}
				else score[i]+= p[9][0] + p[9][1];
			}
		for(int a=0;a<8;a++){
			if(s[a]==1){
				if(s[a+1]==0)score[i]+= 10 + p[a+1][0] + p[a+1][1];
				else  score[i]+= 10 + 10 + p[a+2][0];
			}
			else if(pr[a]==1) score[i]+= 10 + p[a+1][0];
			else score[i]+= p[a][0] + p[a][1];
		}
			if(s[8]==0){
				if(pr[8]==1)score[i]+= p[8][0] + p[8][1] + p[9][0];
				else score[i]+= p[8][0] + p[8][1];
			}else score[i]+= 10+p[9][0] +p[9][1];
			for(int h=0;h<14;h++) {
				s[h]=0,pr[h]=0;
				p[h][0]=0,p[h][1];
			}
	}
	for(int i=0;i<m;i++){
		score1[i] = score[i];
	}sort(score1,score1+m);
	for(int i=0;i<m;i++){
		for(int l=0;l<m;l++){
			if(score1[i]==score[l]){
				n1[i] = n[l];
				break;
			}
		}
	}
	for(int i=m-1;i>=0;i--){
		cout << n1[i] << "  " << score1[i] << endl;
	}
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

class T{

public:
  int indx;
  int point;

  bool operator < (const T &a)const{
    if(point == a.point){
      return indx < a.indx;
    }else{
      return point > a.point;
    }
  }
};

int main(){


  vector<T> result;
  int game[21];
  int m;


  while(cin >> m && m){
    result = vector<T>(m);
    for(int i=0; i<m; i++){
      result[i].point=0;
    }

    for(int i=0; i<m; i++){

      cin>>result[i].indx;

      int indx=0;
      while(indx < 20){

	cin >> game[indx];

	//10game
	if(indx==18){
	  cin >> game[++indx];

	  if(game[indx-1]+game[indx] >= 10){
	    cin >> game[++indx];
	  }
	  else{
	    game[++indx]=0;
	  }
	  break;
	}
	//1 to 9 game
	else{
	  if(game[indx]==10){
	    game[++indx]=-1;
	    indx++;
	  }
	  else{
	    cin >> game[++indx];
	    indx++;
	  }
	}
      }
      //while

      /*  cout << endl;
      for(int m=0; m<21; m++){
	cout << game[m] << ' ';
      }cout << endl;
      */

      //score
      indx = 0;
      while(indx<21){

	if(indx == 18){
	  result[i].point+= game[18]+game[19]+game[20];
	  break;
	}
	else{

	  result[i].point+=game[indx];

	  if(game[indx]==10){
	    int work=0;
	    int k=2;
	    while(work<2){
	      if(game[indx+k]!=-1){
		result[i].point+=game[indx+k];
		work++;
	      }
	      k++;
	    }
	    indx+=2;
	  }
	  else{
	    result[i].point+=game[++indx];
	    if(game[indx-1]+game[indx]==10)
	      result[i].point+=game[indx+1];

	    indx++;
	  }
	}

	//cout << "test " <<result[i][1] << endl;;

      }	
      
    }

    //sort
    sort(result.begin(), result.end());
 
    for(int i=0; i<m; i++){
      cout << result[i].indx << ' ' << result[i].point << endl;
    }

  }


  return 0;
}