๐ก Python 3
์์ฐ [Link]
def solution(d, b):
d.sort()
result = 0
for c in d:
if c <= b:
result += 1
b -= c
else:
break
return result
def solution(d, budget):
d.sort()
while budget < sum(d):
d.pop()
return len(d)