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 <iostream>
#include <vector>
#include <utility>
using namespace std;

int main(){
  int m,t,p,r,i,j,k;
  while(1){
    cin >> m >> t >> p >> r;
    if(m==0)break;
    int ac[t]={},wa[t][p+1],actime[t]={};
    for(i=0;i<t;i++){
      for(j=0;j<p+1;j++)wa[i][j]=0;
    }
    for(i=0;i<r;i++){
      int M,T,P,R;
      cin >> M >> T >> P >> R;
      if(R!=0)wa[T-1][P]++;
      else{
        ac[T-1]++;
        actime[T-1]+=wa[T-1][P]*20+M;
      }
    }

    //cout << actime[0] << actime[1] << endl;

    bool flag[t]={};
    int bscore=-1,bfinaltime=-1;
    for(j=0;j<t;j++){
      int team=-1,score=-1,finaltime=300*20;
      for(i=0;i<t;i++){
        if(flag[i]==true)continue;
        if(score<ac[i]){
          team=i;
          score = ac[i];
          finaltime= actime[i];
        }else if(score == ac[i] && finaltime>=actime[i]){
          team=i;
          finaltime=actime[i];
        }
      }
      if(j!=0){
        if(bscore==score && bfinaltime==finaltime)cout << "=";
        else cout << ",";
      }
      cout << team+1;
      flag[team]=true;
      bscore = score;
      bfinaltime=finaltime;
    }
    cout << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct team{
int id;
int ac;
int time[100];
bool ok[200];
};
	int m,t,p,r;
int or(team a,team b){//aのほうが強ければ1,bなら0,同じなら2

if(a.ac>b.ac)return 1;
else if(a.ac<b.ac)return 0;
int at=0,bt=0;
for(int i=0;i<=p;i++){
if(a.ok[i]==true)at+=a.time[i];
if(b.ok[i]==true)bt+=b.time[i];
}
if(at<bt)return 1;
else if(at>bt)return 0;
else return 2;
}
int main(){

	while(true){
	cin>>m>>t>>p>>r;
	if(m+t+p+r==0)break;
	vector<team>ta(0);
	ta.resize(200);

	for(int i=0;i<=t;i++)for(int j=0;j<200;j++)ta[i].time[j]=0,ta[i].ok[j]=0;
	for(int i=0;i<=t;i++)ta[i].id=i,ta[i].ac=0;
	for(int i=0;i<r;i++){
	int a,b,c,d;
	cin>>a>>b>>c>>d;//a:経過時間:bチーム番号c:問題番号j:0奈良正解それ以外不正解
	if(d==0){
	ta[b].time[c]+=a;
	ta[b].ac++;
	ta[b].ok[c]=true;
	}
	else {
	ta[b].time[c]+=20;
	}
	}
	ta.erase(ta.begin());
	for(int i=0;i<t;i++){
	for(int j=0;j<t;j++){
	if(or(ta[i],ta[j])==1)swap(ta[i],ta[j]);
	if(or(ta[i],ta[j])==2&&ta[i].id>ta[j].id)swap(ta[i],ta[j]);
	}
	}
	for(int i=0;i<t-1;i++){
	if(or(ta[i],ta[i+1])!=2)cout<<ta[i].id<<",";
	else cout<<ta[i].id<<"=";
	}
	cout<<ta[t-1].id<<endl;
	}
	return 0;
}

C++: #include<iostream>
//#include<fstream>
#include<vector>

using namespace std;

int main(){
	
	//ifstream fin;
	//fin.open("input.txt");

	int M, T, P, R;//input
	int m, t, p, j;//input

	int time[50];	//経過時間
	int solve[50];	//正解数
	int miss[50][10];	//間違えた数
	int count,teamcount;
	vector<int> v,s;//解けた問題数ごとに...
	
	while(true){
		for (int i = 0; i < 50; i++){//初期化
			for (int k = 0; k < 10; k++)miss[i][k] = 0;
			time[i] = solve[i] = 0;
		}
		M = T = P = R = m = t = p = j = 0;

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

		while (R > 0){//結果計算
			R--;
			cin >> m >> t >> p >> j;
			t--;
			if (j == 0){
				time[t] += m;
				time[t] += miss[t][p] * 20;
				solve[t]++;
			}
			else miss[t][p]++;
		}
		
		for (int i = 0; i < T; i++){
			cout << "チーム" << i+1 << endl << " 経過時間：" << time[i] << " 回答数：" << solve[i];
			cout << endl;
		}
		

		//以下ソート
		count = 0;//初期化
		teamcount = 0;
		for (int i = 0; i < T; i++)if (count < solve[i])count = solve[i];

		while (count >= 0){
			for (int i = 0; i < T; i++)if (count == solve[i]){
				v.push_back(i);//countだけ解けたチームを記憶
				s.push_back(time[i]);//解けたチームの時間を記憶
				teamcount++;
			}

			//バブルソート
			if (s.size() > 1){
				for (int i = 0; i < (int)v.size() - 1; i++)
					for (int k = (int)v.size() - 1; k > i; k--){
						if (s[k] > s[k - 1]){
							int tmp = s[k];
							int temp = v[k];

							s[k] = s[k - 1];
							v[k] = v[k - 1];
							
							s[k - 1] = tmp;
							v[k - 1] = temp;
						}
					}
			}
			if (v.size() > 1){
				for (int i = 0; i < (int)v.size() - 1; i++)
					for (int k = (int)v.size() - 1; k > i; k--)
						if (s[k] == s[k - 1] && v[k] < v[k - 1]){
							int tmp = v[k];
							v[k] = v[k - 1];
							v[k - 1] = tmp;
						}
			}
			//ソート終了

			//output
			while (v.size() > 2){
				if (s[v.size() - 1] == s[v.size() - 2]/* || s[v.size()] == s[v.size() - 1]*/)
					cout << v.back() + 1 << '=';
				else cout << v.back() + 1 << ",";
				v.pop_back();
			}
			if (v.size() == 2){//最後の二つだけ例外処理

				if (s[1] == s[0])
					 cout << v.back()+1 << "=";
				else cout << v.back()+1 << ',';
					v.pop_back();
					cout << v.back()+1;
					if (teamcount != T)cout << ',';
					v.pop_back();
			}
			if (v.size() == 1){
				cout << v.back() + 1;
				if(teamcount != T)cout << v.back() + 1 << ',';
				v.pop_back();
			}
			v.clear();
			s.clear();
			count--;
		}
		cout << endl;
	}
	return 0;
}