11047 동전0, 5585 거스름돈

백준 알고리즘 기초
문제보기

답1

N, K = map(int, input().split())
coins = sorted([int(input()) for _ in range(N)], reverse=True)
count = 0
for i in range(N):
    if coins[i] <= K:
        count += K//coins[i]
        K = K % coins[i]
    if K == 0:
        break
print(count)

답2

코드를 입력하세요

문제보기

K = 1000 - int(input())
coins = [500, 100, 50, 10, 5, 1]
count = 0
for i in range(len(coins)):
    if coins[i] <= K:
        count += K//coins[i]
        K = K % coins[i]
    if K == 0:
        break
print(count)