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 <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>

#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
#define F first
#define S second

using namespace std;

int M,T,P,R,m,t,p,j;
int pen[55][15];

int main() {
  while(1){
      cin>>M>>T>>P>>R;
      if(M==0) break;
      REP(i,0,T)REP(k,0,P) pen[i][k]=0;
      vector< pair<pair<int,int>,int> > v(T); //<solv, pen>, id
      REP(i,0,T) v[i].F.F = v[i].F.S = 0, v[i].S = (-1)*i;
      REP(i,0,R){
        cin>>m>>t>>p>>j;
        if(j==0){
            v[t-1].F.F++;
            v[t-1].F.S += m + pen[t-1][p-1]*20;
        }
        else pen[t-1][p-1]++;
      }
      sort(v.begin(),v.end());

      bool flag = true;
      for(int sol=P; 0<=sol; sol--){
        REP(i,0,v.size()){
          if(v[i].F.F==sol){
            if(flag){
              cout<<(-1)*v[i].S+1;
              flag = false;
            }else{
              if(i>0){
                if(v[i].F.S==v[i-1].F.S && v[i].F.F==v[i-1].F.F) cout<<"="<<(-1)*v[i].S+1;
                else cout<<","<<(-1)*v[i].S+1;
              }else{
                cout<<","<<(-1)*v[i].S+1;
              }
            }
          }
        }
      }
      cout<<endl;
  }


  return 0;
}

C++: #include <cstdio>
#include <algorithm>

using namespace std;

struct team {
	team() {
		for (int i = 0; i < 10; ++i) {
			ac[i] = -1;
			fa[i] = 0;
		}
	}
	int no;
	int ac[10];
	int fa[10];
	
	int na() const {
		int ans = 0;
		for (int i = 0; i < 10; ++i)
			if (ac[i] != -1)
				++ans;
		return ans;
	}
	
	int st() const {
		int ans = 0;
		for (int i = 0; i < 10; ++i)
			if (ac[i] != -1)
				ans += ac[i] + fa[i] * 20;
		return ans;
	}
	
	bool operator==(const team &rh) const {
		return this->na() == rh.na() && this->st() == rh.st();
	}
	
	bool operator<(const team &rh) const {
		if (this->na() > rh.na())
			return true;
		else if (this->na() < rh.na())
			return false;
		
		if (this->st() < rh.st())
			return true;
		else if (this->st() > rh.st())
			return false;
		
		return this->no > rh.no;
	}
};

int main()
{
	for (;;) {
		int m, t, p, r;
		scanf("%d %d %d %d", &m, &t, &p, &r);
		if (m == 0 && t == 0 && p == 0 && r == 0)
			break;
			
		team teams[50];
		for (int i = 0; i < t; ++i)
			teams[i].no = i + 1;
		
		for (int i = 0; i < r; ++i) {
			int m, t, p, j;
			scanf("%d %d %d %d", &m, &t, &p, &j);
			
			if (j == 0)
				teams[t - 1].ac[p - 1] = m;
			else
				teams[t - 1].fa[p - 1] += 1;
		}
		
		sort(teams, teams + t);
		
		for (int i = 0; i < t; ++i) {
			printf("%d", teams[i].no);
			if (i == t - 1)
				printf("\n");
			else if (teams[i] == teams[i + 1])
				printf("=");
			else
				printf(",");
		}
	}
	
	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;
	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;//初期化
		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]);//解けたチームの時間を記憶
			}

			//バブルソート
			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 (s[v.size()-1] != 0)cout << ',';
					v.pop_back();
			}
			if (v.size() == 1){
				cout << v.back()+1 << ',';
				v.pop_back();
			}
			v.clear();
			s.clear();
			count--;
		}
		cout << endl;
	}
	return 0;
}