[코테] 프로그래머스 - 완전범죄

def solution(info, n, m):
    # b/a asc, b desc
    info.sort(key=lambda x: (x[1]/x[0], -x[1]))
    
    sumA, sumB = 0, 0
    for i in info:
        if sumB + i[1] < m:
            sumB += i[1]
        else:
            sumA += i[0]
    
    if sumA < n:
        return sumA
    else:
        return -1


# https://school.programmers.co.kr/learn/courses/30/lessons/389480