Programmers 숫자 게임

Updated:

Answer

def solution(a, b):
    ans =0
    a=sorted(a,reverse=True)
    b=sorted(b,reverse=True)
    for i in a:
        Min = i
        for j in range(len(b)):
            if b[j] > Min:
                Min = b[j]
            else:
                break
        if Min == i:
            continue
        else:
            b.remove(Min)
            ans+=1
    return ans

Categories:

Updated: