IT/알고리즘 공부
(백준) 11047 - 동전 0
오징옆
2019. 11. 11. 23:13
N,K = map(int,input().split())
money = []
Total_count = 0
for i in range(N):
money.append(input())
money = list(map(int, money))
money.sort(reverse=True)
for i in range(0,N):
if int(money[i]) <= K:
Total_count += int(K/int(money[i]))
count = int(K/int(money[i]))
K = K-count*int(money[i])
elif K <= 0:
break
print(Total_count)