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 <cstdio>
#include <cstdint>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <utility>
#include <algorithm>
#include <numeric>

int calc(std::vector<int> const& pts) {
  std::vector<std::vector<int>> frame(10);
  {
    size_t i = 0;
    for (int p: pts) {
      frame[i].push_back(p);
      if (i < 9) {
        if (frame[i].size() == 2) {
          ++i;
        } else if (std::accumulate(frame[i].begin(), frame[i].end(), 0) == 10) {
          ++i;
        }
      }
    }
  }
  std::vector<int> framescore(10);
  for (size_t i = 0; i < 9; ++i) {
    framescore[i] = std::accumulate(frame[i].begin(), frame[i].end(), 0);
    if (framescore[i] == 10) {
      if (frame[i].size() == 1) {
        // strike
        framescore[i] += frame[i+1][0];
        if (frame[i+1].size() > 1) {
          framescore[i] += frame[i+1][1];
        } else {
          framescore[i] += frame[i+2][0];
        }
      } else {
        assert(frame[i].size() == 2);
        // spare
        framescore[i] += frame[i+1][0];
      }
    }
  }
  framescore[9] = std::accumulate(frame[9].begin(), frame[9].end(), 0);
  return std::accumulate(framescore.begin(), framescore.end(), 0);
}

int testcase_ends() {
  size_t m;
  scanf("%zu", &m);
  if (m == 0) return 1;

  std::vector<std::pair<int, int>> ss(m);
  for (size_t i = 0; i < m; ++i) {
    int id;
    scanf("%d", &id);

    char buf[1024];
    fgets(buf, sizeof buf, stdin);
    char* pos = buf;
    std::vector<int> pts;
    while (true) {
      char* endpos;
      int x = strtol(pos, &endpos, 10);
      if (endpos == pos) break;
      pos = endpos;
      pts.push_back(x);
    }
    // for (size_t j = 0; j < ss[i].second.size(); ++j)
    //   fprintf(stderr, "%d%c", ss[i].second[j], j+1<ss[i].second.size()? ' ':'\n');

    ss[i].first = -calc(pts);
    ss[i].second = id;
  }
  std::sort(ss.begin(), ss.end());
  for (auto const& si: ss)
    printf("%d %d\n", si.second, -si.first);

  return 0;
}

int main() {
  while (!testcase_ends()) {
  }
}

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;
}

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;
 }
 return 0;
 }