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<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<a;i++){
			q[i]=0;
			for(j=0;j<12;j++) 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;
				}
			}
		}
		for(i=0;i<a;i++){
			printf("%d %d\n",s[i],q[i]);
		}
	}
	return 0;
}

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

struct bp {
	int nb, pt;

	bool operator < (const bp & rhs) const {
		return pt > rhs.pt || (pt == rhs.pt && nb < rhs.nb);
	}
};

int main()
{	
	int n;

	cin >> n;

	while (n > 0) {
		vector<bp> a(n);

		for (int i = 0; i < n; i++) {
			cin >> a[i].nb;

			vector<int> b;

			while (cin.get() != '\n') {
				int t;
				cin >> t;
				b.push_back(t);
			}

			a[i].pt = 0;
			int j = 0, fl = 1;
			while (j < b.size()) {
				if (fl == 10) {
					a[i].pt += b[j];
					j++;
				}
				else {
					fl++;
					a[i].pt += b[j] + b[j + 1];

					if (b[j] == 10 || b[j] + b[j + 1] == 10)
						a[i].pt += b[j + 2];

					if (b[j] == 10)
						j++;
					else
						j += 2;
				}
 			}
		}

		sort(a.begin(), a.end());

		for (int i = 0; i < n; i++)
			cout << a[i].nb << " " << a[i].pt << endl;

		cin >> n;
	}

	return 0;
}

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

int main(){


  int result[40][2];
  int game[21];
  int m;


  while(cin >> m && m){

    for(int i=0; i<m; i++){
      result[i][1]=0;
    }

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

      cin>>result[i][0];

      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][1]+= game[18]+game[19]+game[20];
	  break;
	}
	else{

	  result[i][1]+=game[indx];

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

	    indx++;
	  }
	}

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

      }	
      
    }

    //sort
    for(int i=0; i<m; i++){
      for(int j=i; j<m; j++){
	if(result[i][1] < result[j][1]){
	  int tmp=result[i][1];
	  result[i][1]=result[j][1];
	  result[j][1]=tmp;
	  
	  tmp = result[i][0];
	  result[i][0]=result[j][0];
	  result[j][0]=tmp;
	}
      }
    }

    for(int i=0; i<m; i++){
      cout << result[i][0] << ' ' << result[i][1] << endl;
    }

  }


  return 0;
}