Closed ji-0630 closed 1 year ago
def solution(d, budget):
d = sorted(d)
answer = 0
for i in d:
if budget - i >= 0:
budget -= i
answer += 1
else:
break
return answer
def solution(d, budget):
d.sort()
while budget < sum(d):
d.pop()
return len(d)
문제 설명