백준 2294

 

코드

n, k = map(int, input().split())
coin_list = []
for i in range(n):
    coin_list.append(int(input()))

dp = [10001] * (k+1)
dp[0] = 0

for i in range(1, k+1):
    for coin in coin_list:
        if coin <= i:
            dp[i] = min(dp[i], dp[i-coin]+1)

if dp[k] < 10001:
    print(dp[k])
else:
    print(-1)