[HackerRank] Jesse and Cookies
- 문제 링크
https://www.hackerrank.com/challenges/jesse-and-cookies/problem?isFullScreen=true
- 코드
def cookies(k, A):
import heapq
cnt = 0
heapq.heapify(A) #A: list -> heap
while(A[0]<k and len(A)>1):
sweetness = heapq.heappop(A) + 2*heapq.heappop(A)
heapq.heappush(A,sweetness)
cnt += 1
if(A[0] < k):
return -1
return cnt
'공부 > Algorithm' 카테고리의 다른 글
[LeetCode] Implement Trie (0) | 2022.03.21 |
---|---|
[LeetCode] Two sum (0) | 2022.03.15 |
[HackerRank] Balanced Brackets (0) | 2022.03.11 |
[HackerRank] Equal stacks (0) | 2022.03.08 |
[HackerRank] Merge two sorted linked lists (0) | 2022.03.07 |
댓글