백준 3758. KCPC

https://www.acmicpc.net/problem/3758

import sys
input = sys.stdin.readline

T = int(input())
for _ in range(T):
    n, k, t, m = map(int,input().split()) # 팀개수, 문제개수, 내팀아이디, 로그엔트리개수
    ans = 0 # 내팀 순위
    scores = [[0,0,0,i] for i in range(n+1)] # 최종점수, 풀이제출횟수, 마지막제출시간
    problems = [[0]* (k+1) for _ in range(n+1)]
    for time in range(m):
        i, j, s = map(int,input().split()) # 팀아이디, 문제번호, 획득점수
        scores[i][1] += 1
        if s > problems[i][j]:
            problems[i][j] = s
        scores[i][2] = time
    for i in range(1, n+1):
        scores[i][0] += sum(problems[i])

    scores.sort(key= lambda x : (-x[0], x[1], x[2]))
    for i in range(n+1):
        if scores[i][3] == t:
            print(i+1)
            break