내 풀이

def solution(sizes):
    answer = 0
    w_max, h_max = 0, 0

    for w, h in sizes:
        if h > w:
            h, w = w, h
        if w_max < w:
            w_max = w
        if h_max < h:
            h_max = h

    return w_max * h_max

내 풀이

def solution(citations):
    citations.sort(reverse=True)
    l = len(citations)
    cnt = 0
    for i in range(l):
        if citations[i] > i:
            cnt += 1
    return cnt

내 풀이

def solution(array, commands):
    answer = []
    numbers = []

    for i in commands:
        numbers = sorted(array[i[0]-1:i[1]])
        answer.append(numbers[i[2]-1])

    return answer

다른 사람 풀이(최홍범님)

def solution(array, commands):
    answer = []
    for command in commands:
        i,j,k = command
        answer.append(list(sorted(array[i-1:j]))[k-1])
    return answer