Algorithm/noj.am

[Python] 백준 11047번 - 동전 0

SweetDev 2021. 1. 24. 05:22
# 11047번 동전0
import sys
N, K = map(int, sys.stdin.readline().split())
coins = []
count = 0

for i in range(N):
    coins.append(int(sys.stdin.readline()))

coins.reverse()
while K != 0:
    for coin in coins:
        if coin <= K:
            K -= coin
            count += 1
            break
print(count)