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<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> Pi;
typedef tuple<int,int,int> tp;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
void solve(int M,int T, int P, int R){
    vector<tp> V(T);//cnt time
    rep(i,0,T)get<2>(V[i]) = i+1;
    int errors[T][P];
    int result[T][P];
    rep(i,0,T)rep(j,0,P)errors[i][j] = result[i][j] = 0;
    rep(i,0,R){
        int m,t,p,j;
        cin >> m >> t >> p >> j;
        t--;p--;
        if(j == 0){
            //AC
            //get<1>(V[t]) = m;
            get<0>(V[t])++;
            result[t][p] = m + 1;
        }else{
            //WA
            errors[t][p]++;
        }
    }
    rep(i,0,T){
        rep(j,0,P){
            //ACしたときのみWA数*20minペナルティ追加
            if(!result[i][j])continue;
            get<1>(V[i]) += result[i][j] - 1 + errors[i][j] * 20;
        }
    }
    sort(V.begin(), V.end(), [](tp a, tp b){
        if(get<0>(a) != get<0>(b))return get<0>(a) > get<0>(b);
        if(get<1>(a) != get<1>(b))return get<1>(a) < get<1>(b);
        return get<2>(a) > get<2>(b);
    });
    cout << get<2>(V[0]);
    
    rep(i,1,T){
        if(get<0>(V[i-1]) == get<0>(V[i]) && get<1>(V[i-1]) == get<1>(V[i])){
            cout << "=";
        }else{
            cout << ",";
        }
        cout << get<2>(V[i]);
    }
    cout << endl;
}
main(){
    int M,T,P,R;
    cin >> M >> T >> P >> R;
    while(M){
        solve(M,T,P,R);
        cin >> M >> T >> P >> R;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

class Team{
  public:
  int id;
  int solvednum;
  int penalty;
  vector<bool> solved;
  vector<int> WA;
  Team(int id, int N){
    this->id = id;
    solvednum = 0;
    penalty = 0;
    solved.resize(N, false);
    WA.resize(N, 0);
  }
  bool operator == (const Team &t)const{
    return id == t.id;
  }
  bool operator < (const Team &t)const{
    if(solvednum == t.solvednum){
      if(penalty == t.penalty){
        return id > t.id;
      }
      return penalty < t.penalty;
    }
    return solvednum > t.solvednum;
  }
  string toString(){
    return to_string(id) + " " + to_string(solvednum) + " " + to_string(penalty);
  }
};

int main(void){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int M, T, P, R;
  while(cin >> M >> T >> P >> R, M | T | P | R){
  vector<Team> teams;
  for(int i = 0;  i < T; i++){
    teams.push_back(Team(i+1, P));
  }
  for(int asd = 0; asd < R; asd++){
    int m, t, p, j;
    cin >> m >> t >> p >> j;
    t--;
    if(j == 0){
      teams[t].solved[p] = true;
      teams[t].solvednum++;
      teams[t].penalty += m + 20*teams[t].WA[p];
    }else{
      teams[t].WA[p]++;
    }
  }
  sort(teams.begin(), teams.end());

  cout << teams[0].id;
  for(int i = 1; i < T; i++){
    if(teams[i].solvednum == teams[i-1].solvednum && teams[i].penalty == teams[i-1].penalty){
      cout << '=';
    }else{
      cout << ',';
    }
    cout << teams[i].id;
  }
  cout << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<string>
using namespace std;
struct team{int m;
                   int t;
                   int p;
                   int j;
                   };
int A[100000];
vector<int>G;
int main(){
	int M,T,P,R;
	vector<pair<int,int> > sum;
	cin>>M;
	cin>>T;
	cin>>P;
	cin>>R;
	int ms[R];
    team A[R];
    for(int i=0;i<R;i++){
		scanf("%d%d%d%d",&A[i].m,&A[i].t,&A[i].p,&A[i].j);
	}
	for(int i=0;i<T;i++){
		sum.push_back(make_pair(0,i));
	}
	for(int i=0;i<T;i++){
		ms[i]=0;
		for(int k=0;k<R;k++){
			if(A[k].t==i){
				ms[i]+=A[i].m;
				if(A[k].j==0){
					sum[i].first+=1;
				}
			}
		}
	}
	sort(sum.begin(),sum.end());
    for(int i=0;i<T;i++){
    	if(i>0){
    	if(sum[i]==sum[i-1]){
    		printf("=")
    	}
    	else{
    		printf(" ")
    	}
    	}
    	printf("%d",sum[i].second);
    }
   }