https://programmers.co.kr/learn/courses/30/lessons/12982
def solution(d, budget):
answer = 0
d.sort()
s=0
for i in d:
s+=i
if s>budget:
break
else:
answer+=1
return answer
def solution(d, budget):
d.sort()
while budget < sum(d):
d.pop()
return len(d)