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<map>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#define INF 1e9
#define M_Team 50
#define M_Pro 10

typedef long long int ll;
using namespace std;

int wacount[M_Team+1][M_Pro+1]={};
int timesum[M_Team+1]={},anssum[M_Team+1];
vector<char> ans;


void set(int n){
	if(n <10){
		ans.push_back(n+'0');
	}
	else{
		ans.push_back(n/10+'0');
		ans.push_back(n%10+'0');
	}
}

void out(int timesum[M_Team+1],int grad[M_Team+1],int T){
	set(grad[1]);
	for(int i=2;i<=T;i++){
		if(anssum[ grad[i] ]==anssum[ grad[i-1] ]  &&  timesum[ grad[i] ] == timesum[ grad[i-1] ] ){
			ans.push_back('=');

			set(grad[i]);
		}
		else{
			ans.push_back(',');

			set(grad[i]);
		}
	}
	for(int i=0;i<ans.size();i++){
		cout<<ans[i];
	}
	cout<<endl;
}

bool checkOver(int a,int b){
	if(anssum[a] <  anssum[b])return true;
	if( (anssum[a] == anssum[b]) && (timesum[a]>timesum[b]) )return true;
	return false;
}


void babu_sort(int anssum[M_Team+1],int timesum[M_Team+1],int grad[M_Team+1],int T){
	for(int i=0;i<T;i++){
		for(int j=1;j<T-i;j++){
			if( checkOver(grad[j],grad[j+1]) ){
				swap(grad[j],grad[j+1]);
			}
		}
	}
}

void solve(int anssum[M_Team+1],int timesum[M_Team+1],int M,int T,int P,int R){
	int grad[M_Team+1];
	for(int i=T;i>=1;i--){
		grad[T-i+1]=i;
	}
	babu_sort(anssum,timesum,grad,T);
	out(timesum,grad,T);
}

/*
int wacount[51][11]={};
int timesum[11]={},anssum[11];

*/

int main(){
	while(1){
//初期化
		ans.clear();
		for(int i=0;i<M_Pro+1;i++){
			for(int j=0;j<M_Team+1;j++){
				wacount[i][j]=0;
			}
			timesum[i]=0;
			anssum[i]=0;
		}
///////
		int M,T,P,R;
		int m,t,p,J;
		cin>>M>>T>>P>>R;
		if(M==0 && T==0 && P==0 && R==0)break;
		for(int i=0;i<R;i++){
			cin>>m>>t>>p>>J;
			if(J!=0){
				wacount[t][p]++;
			}
			else{
				timesum[t]+=m+wacount[t][p]*20;
				anssum[t]++;
			}
		}
		solve(anssum,timesum,M,T,P,R);
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>

#define pb(s) push_back(s)

#define MAX_T 50
#define MAX_P 10

using namespace std;

struct team{
	int unsolve[MAX_P+1];
	int solves, times, num;
};

bool comp1(const team& x, const team& y){ return x.solves > y.solves; }
bool comp2(const team& x, const team& y){ return x.times < y.times; }
bool comp3(const team& x, const team& y){ return x.num > y.num; }

int M, T, P, R;

team teams[MAX_T+1];

int main(){
	while(1){
		cin >> M >> T >> P >> R;
		if(M == 0) break;
		for (int i = 0; i < MAX_T+1; i++)
		{
			teams[i].solves = -1;
			teams[i].num = i;
		}
		for (int i = 1; i <= T; i++)
		{
			teams[i].solves = 0;
			teams[i].times = 0;
			for (int j = 0; j < MAX_P; j++)
			{
				teams[i].unsolve[j] = 0;
			}
		}
		for (int i = 0; i < R; i++)
		{
			int m, t, p, j;
			cin >> m >> t >> p >> j;
			if(j == 0){
				teams[t].solves++;
				teams[t].times += m;
				teams[t].times += 20*teams[t].unsolve[p];
			}else{
				teams[t].unsolve[p]++;
			}
		}
		sort(teams+1, teams+T+1, comp1);
		int j = 1;
		for (int i = 1 ; i < T; i++)
		{
			if(teams[i].solves != teams[i+1].solves){
				sort(teams+j, teams+i+1, comp2);
				j = i+1;
			}
			if(i == T-1){
				sort(teams+j, teams+T+1, comp2);
			}
		}
		for (int i = 1; i <= T ; i++)
		{
			cout << teams[i].times << endl;
		}
		j = 1;
		for (int i = 1 ; i < T; i++)
		{
			if(teams[i].times != teams[i+1].times){
				sort(teams+j, teams+i+1, comp3);
				bool flag = false;
				for (int k = j; k <= i ; k++)
				{
					if(flag) cout << "=" << teams[k].num;
					else{
						cout << teams[k].num;
						flag = true;
					}
				}
				cout << ",";
				j = i+1;
			}
			if(i == T-1){
				sort(teams+j, teams+T+1, comp3);
				bool flag = false;
				for (int k = j; k <= i+1 ; k++)
				{
					if(flag) cout << "=" << teams[k].num;
					else{
						cout << teams[k].num;
						flag = true;
					}
				}
			}
		}
		cout << endl;
	}
	return 0;
}

C++: #include<stdio.h>

int main(){

int M,T,P,R;

while(1){
scanf("%d%d%d%d",&M,&T,&P,&R);
if(M==0&&T==0&&P==0&&R==0)break;

int n[51][11][2]={};int n2[51][11]={};

int m,t,p,j;
for(int i=0;i<R;i++)
{
scanf("%d%d%d%d",&m,&t,&p,&j);
if(j==0){n[t][p]+=m;n2[t][p]=1;}
else{n[t][p]+=20;}
}

int N[51][3]={};
for(int i=1;i<=T;i++)
for(int k=1;k<=P;k++)
{
N[i][0]+=n[i][k];
N[i][1]+=n2[i][k];
}

for(int i=1;i<=T;i++)
for(int k=1;k<=P;k++)
if(N[k][1]>N[k-1][1]){
int t=N[k][1];N[k][1]=N[k-1][1];N[k-1][1]=t;
int t2=N[k][0];N[k][0]=N[k-1][0];N[k-1][0]=t2;
}
for(int i=1;i<=T;i++){
{if(i>1){if(N[i][1]==N[i-1][1]&&N[i][0]==N[i-1][0])printf("=");
else printf(",");}

printf("%d",N[i][1]);
}
printf("\n");
}
return 0;
}