Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		M, T, P, R := io.NextInt(), io.NextInt(), io.NextInt(), io.NextInt()
		if M == 0 {
			break
		}
		score := make([]struct{ num, time, index int }, T)
		submit := make([][]int, T)
		for i := 0; i < T; i++ {
			score[i].index = i + 1
			submit[i] = make([]int, P)
		}

		for i := 0; i < R; i++ {
			m, t, p, j := io.NextInt(), io.NextInt()-1, io.NextInt()-1, io.NextInt()
			if j == 0 {
				score[t].num++
				score[t].time += submit[t][p]*20 + m
			} else {
				submit[t][p]++
			}
		}
		sort.SliceStable(score, func(i, j int) bool {
			return score[i].num < score[j].num || score[i].num == score[j].num && score[i].time > score[j].time
		})

		for i := T - 1; i > 0; i-- {
			io.Printf("%d", score[i].index)
			if score[i].num == score[i-1].num && score[i].time == score[i-1].time {
				io.Printf("=")
			} else {
				io.Printf(",")
			}
		}
		io.Println(score[0].index)
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > L;
int main(void) {
  P team[55][12];
  L mama[55];
  int M, T, Q, R;
  int m, t, p, j;
  while(1){
    memset(team,0,sizeof(team));
    memset(mama,0,sizeof(mama));
    scanf("%d %d %d %d", &M, &T, &Q, &R);
    if(M==0 & T==0) break;
    for ( int i = 0; i < R; i++ ) {
      scanf("%d%d%d%d",&m,&t,&p,&j);
      t--;
      if(j==0) team[t][p]=P(m+team[t][p].first,1);
      else team[t][p]=P(20+team[t][p].first,0);
    }

    for(int i=0;i<T;i++){
      for(int l=1;l<=Q;l++){
        if(team[i][l].second==1){
          mama[i].first--;
          mama[i].second.first+=team[i][l].first;
        }
      }

      mama[i].second.second= -i;
    }

    sort(mama,mama+T);

//    for(int i=0;i<T;i++) cout << "first :" << mama[i].first << "second.first :" << mama[i].second.first << "second.second :" << mama[i].second.second << endl;

    printf("\n");
    for(int i=0;i<T;i++){
    if(i==T-1) {
      printf("%d",-mama[i].second.second+1);
      break;
    }
    if(mama[i].first==mama[i+1].first && mama[i].second.first == mama[i+1].second.first){
      printf("%d=",-mama[i].second.second+1);
    }
    else  printf("%d,",-mama[i].second.second+1);
    }
printf("\n");
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
P info[51][11];
//bool team[51];
vector<P> v;

map<int, P> mp;
//int D[51];
vector<int> order;

string ans = "A";
//自作の比較関数
bool comp(P lhs, P rhs){
	if(lhs.first != rhs.first){
		return lhs.first < rhs.first;
	}
	if(lhs.second != rhs.second){
		return lhs.second > rhs.second;
	}
}

int main(){
while(1){//start


	int M, T, P, R;
	cin >> M >> T >> P >> R;
	if(M == 0 and T == 0 and P == 0 and R == 0) break;

	//初期化
	for(int i = 0; i < 51; i++){
		for(int j = 0; j < 11; j++){
			info[i][j].first = 0;
			info[i][j].second = 0;
		}
	}
	bool team[51] = {0};
	int D[51] = {0};
	int OK[51] = {0};

	//データを格納
	for(int i = 0; i < R; i++){
		int m, t, p, j;
		cin >> m >> t >> p >> j;
		team[t] = true;

		if(j == 0){
			info[t][p].second = m + 20*info[t][p].first;
			OK[t-1] += 1;
		}
		else{
			info[t][p].first += 1;
		}
	}

	//vの内部はキーがチーム名(解いた数/合計時間)
	for(int i = 1; i <= T; i++){
			int sum = 0, ok = 0;
			for(int j = 0; j < 11; j++) sum += info[i][j].second;
			//for(int j = 0; j < 11; j++) if(info[i][j].second) ok += 1;
			int tmp = OK[i-1];
			v.push_back(make_pair(tmp, sum));
			mp[i] = make_pair(tmp, sum);
	}

	sort(v.begin(), v.end(), comp);
	reverse(v.begin(), v.end());
	//debug
	//for(int i = 0; i < (int)v.size(); i++) cout << v[i].first << " " << v[i].second << endl;

	//重複カウンタを作成
	int d = 1;
	D[0] = 1;
	for(int i = 1; i < (int)v.size(); i++){
		if(v[i-1].first == v[i].first and v[i-1].second == v[i].second){
			D[i] = d;
		}
		else{
			d++;
			D[i] = d;
		}
	}

	//debug
	//for(int i = 0; i < (int)v.size(); i++) cout << D[i] << endl;

	//ソート結果にチーム名を割り当てる
	bool vis[51] = {false};
	for(int i = 0; i < (int)v.size(); i++){
		for(int j = (int)v.size(); 1 <= j; j--){
			if(v[i] == mp[j]){
				if(vis[j] == false){
					order.push_back(j);
					vis[j] = true;
				}
			}
		}
	}

	//debug
	//for(int i = 0; i < (int)v.size(); i++) cout << order[i] << endl;

	//出力
	//まず重複数を記録する
	int num[51] = {0};
	for(int i = 0; i < 51; i++) num[D[i]] += 1;


	int idx = 0;
	for(int i = 1; i <= (int)order.size(); i++){
		if(num[i] == 0) break;
		else if(num[i] == 1){
			ans += to_string(order[idx]);
			idx++;
		}
		else{
			for(int j = 0; j < num[i]; j++){
				if(j == num[i]-1) ans += to_string(order[idx]);
				else ans += to_string(order[idx]) + "=";
				idx++;
			}
		}
		ans += ",";
	}

	ans.erase(ans.begin() + 0);
	ans.erase(ans.end() - 1);
	cout << ans << endl;

	//初期化
	v.clear();
	mp.clear();
	order.clear();
	
	ans="A";


}//end

	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; ++i)

class Team{
public:
    int time;
    int tnum;
    int ans;
};

bool cmp(Team &a,Team &b){
    if(b.ans<a.ans){
        return true;
    } else if(b.ans==a.ans){
        if(b.time>a.time){
            return true;
        } else if(b.time==a.time){
            if(a.tnum>b.tnum){
                return true;
            }
        }
    }
    return false;
}

bool eql(Team &a,Team &b){
    return (b.ans==a.ans && b.time==a.time);
}

int main(){
    while(1){
        int M,T,P,R;
        cin>>M>>T>>P>>R;
        if(M==0){
            break;
        }
        int miss[T][P]={};
        Team ts[T]={};
        rep(k,T){
            ts[k].tnum=k+1;
        }

        rep(i,R){
            int m,t,p,j;
            cin>>m>>t>>p>>j;
            if(j==0){
                ts[t-1].ans++;
                ts[t-1].time+=m+miss[t-1][p-1]*20;
            }
            else
            {
                miss[t-1][p-1]++;
            }
        }

        sort(&ts[0],&ts[T],cmp);
        rep(i,T){
            if(i>=1){
                if(eql(ts[i-1],ts[i])){
                    cout<<"=";
                }
                else{
                    cout<<",";
                }
            }
            cout<<ts[i].tnum;
        }
        cout<<endl;
    }
}