[프로그래머스] 귤고르기

귤고르기

프로그래머스

 

• 내 풀이
  • Counter 사용
  • https://www.daleseo.com/python-collections-counter/

from queue import PriorityQueue
def solution(k, tangerine):
    s=list(set(tangerine))
    n=len(s)
    queue=PriorityQueue()
    for i in s:
        queue.put(-tangerine.count(i))
    result=0
    cnt=0
    
    for i in range(queue.qsize()):
        c=-(queue.get())  
        result+=c
        if result>=k:
            return cnt+1
        cnt+=1