[백준 11047] 동전 0

▶ 코드

 

N, k = map(int, input().split(' '))

lst = [0]*N
for i in range(N):
    lst[i] = int(input()) # [1,5,10]

lst = sorted(lst, reverse=True)
#print(lst)
      
c = 0
while k > 0:
  for i in range(len(lst)):
    if k >= lst[i]:
        q = k//lst[i]
        k -= q * lst[i]
        c += q
print(c)