[프로그래머스 Lv. 2] H-Index (정렬)

 

내 풀이

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