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 <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <sstream>
#include <cstdio>
using namespace std;
typedef pair <int,int> p;
vector<p> V;

bool compare(p a,p b) {
  if(a.first != b.first) {
    return a.first > b.first;
  }
  else {
    return a.second < b.second;
  }
}

p score(string str) {
  stringstream ss;
  string s;
  int number;
  ss << str;
  ss >> number;
  int frame = 1,play=1,point[11] = {};
  int spare[22] = {},strike[22] = {};
  bool check = true;
  while(ss >> s) {
    int pin = atoi(s.c_str());
    if(check) point[frame] += pin;
    for(int i=1;i<11;i++) {
      if(strike[i]>0) {
	point[i]+=pin;
	strike[i]--;
      }
      if(spare[i]>0) {
	point[i]+=pin;
	spare[i]--;
      }
    }
    if(play==1&&pin==10) {
      strike[frame]=2;
      if(frame!=10) frame++;
      else check = false;
      play=1;
      continue;
    }
    if(play==1&&pin!=10) {
      play++;
      continue;
    }
    if(play==2&&point[frame]==10) {
      spare[frame] = 1;
      if(frame!=10)frame++;
      else check = false;
      play=1;
      continue;      
    }
    if(play==2&&point[frame]!=10) {
      frame++;
      play=1;
      continue;
    }
  }
  int sum=0;
  for(int i=1;i<=10;i++) {
    //  cout << point[i] << " ";
    sum += point[i];
  }
  // cout << sum << endl;
  p ans;
  ans.first = sum;
  ans.second = number;
    return ans;
}
  
int main() {
  int m;
  string str;
  while(scanf("%d\n",&m),m) {
    for(int i=0;i<m;i++) {
      p temp;
      getline(cin,str);
      temp = score(str);
      V.push_back(temp);
    }
    sort(V.begin(),V.end(),compare);
    for(unsigned int i=0;i<V.size();i++) {
      cout << V[i].second << " " << V[i].first << endl;
    }
    V.clear();
  }
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;

int calc_score(vector<int> pins)
{
	int score = 0;
	int frame = 1;
	int frame_cnt = 1;
	int now = 0;

	rep(i,pins.size())
	{
		if (frame != 10)
		{
			if (frame_cnt == 1)
			{
				if (pins[i] == 10)
				{
					//????????¬????????????????????§??????????????????????????????
					score += 10;
					for (int j=i+1; j<=i+2 && j<pins.size(); j++)
						score += pins[j];
					frame++;
					frame_cnt = 1;	
					continue;
				} else {
					score += pins[i];
					frame_cnt++;
					continue;
				}
			} else if (frame_cnt == 2) {
				if (pins[i-1] + pins[i] == 10)
				{
					//????????¢???????????????
					score += pins[i];
					score += pins[i+1];
					frame++;
					frame_cnt = 1;
					continue;
				} else {
					score += pins[i];
					frame++;
					frame_cnt = 1;
					continue;
				}
			}
		} else if (frame == 10) {
			if (frame_cnt == 1)
			{
				if (pins[i] == 10)
				{
					score += 10;
					//for (int j=i+1; j<=i+2 && j<pins.size(); j++)
					//	score += pins[j];
					frame_cnt = 2;
					continue;
				} else {
					score += pins[i];
					frame_cnt = 2;
					continue;
				}
			} else if (frame_cnt == 2) {
				if (pins[i-1] == 10 && pins[i] == 10)
				{
					score += 10;
					//for (int j=i+1; j<=i+2 && j<pins.size(); j++)
					//	score += pins[j];
					frame_cnt = 3;
					continue;
				} else if (pins[i-1] + pins[i] == 10) {
					score += pins[i];
					//score += pins[i+1];
					frame_cnt = 3;
					continue;
				} else {
					score += pins[i];
					break;
				}
			} else if (frame_cnt == 3) {
				score += pins[i];
			}
		}
	}

	return score;
}

int m;
vector<int> ps;
pair<int, int> lst[100];

signed main()
{
	while (true)
	{
		cin >> m;
		if (m == 0) break;
		cin.ignore();
		string str;
		rep(i,m)
		{
			int num;
			ps.clear();

			getline(cin, str);
			//cout << "getline = " << str << endl;
			stringstream ss(str);

			ss >> num;
			//printf("num = %d\n", num);
			for (int x; ss >> x;)
			{
				ps.push_back(x);
			}

			lst[i] = make_pair(-calc_score(ps), num);
			sort(lst, lst + m);
		}

		rep(i,m)
		{
			cout << lst[i].second << " " << -lst[i].first << endl;
		}
	}
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
	int a,s[41],d[41][22],f[41],g,h[41],i,j,z,x;
	while(1){
		scanf("%d",&a);
		if(a==0) break;
		for(i=0;i<a;i++){
			scanf("%d",&s[i]);
			f[i]=0;
			g=1;
			h[i]=0;
			while(1){
				scanf("%d",&d[i][f[i]]);
				h[i]+=d[i][f[i]];
				if(d[i][f[i]]==10&&g%2==1){
					g++;
				}
				g++;
				f[i]++;
				if(g==19) break;
			}
			scanf("%d %d",&d[i][f[i]],&d[i][f[i]+1]);
			h[i]+=d[i][f[i]]+d[i][f[i]+1];
			if(d[i][f[i]]+d[i][f[i]+1]>=10){
				scanf("%d",&d[i][f[i]+2]);
				h[i]+=d[i][f[i]+2];
			}
			z=0;
			for(j=0;j<f[i];j++){
				if(d[i][j]==10&&z==0){
					h[i]+=d[i][j+1]+d[i][j+2];
				}
				else if(z==0) z=1;
				else if(d[i][j-1]+d[i][j]==10&&z==1){
					h[i]+=d[i][j+1];
					z=0;
				}
				else if(z==1) z=0;
			}
		}
		x=0;
		for(i=0;i<a-1;i++){
			for(j=i+1;j<a;j++){
				if(h[i]<h[j]){
					x=h[i];
					h[i]=h[j];
					h[j]=x;
					x=s[i];
					s[i]=s[j];
					s[j]=x;
				}
				if(h[i]==h[j]){
					if(s[i]>s[j]){
						x=h[i];
						h[i]=h[j];
						h[j]=x;
						x=s[i];
						s[i]=s[j];
						s[j]=x;
					}
				}
			}
		}
		for(i=0;i<a;i++) printf("%d %d\n",s[i],h[i]);
	}
	return 0;
}