프로그래머스(Algorithm)-H-Index(Sort)

def solution(citations):
    h = len(citations)

    while True:
        if len([x for x in citations if x>=h])>=h:
            break
        else:
            h -= 1
    answer = h
    return answer