BOJ - 동전 0

https://www.acmicpc.net/problem/11047

11047번: 동전 0

 

• 그리디 문제이다.
• 큰 동전부터 작은 동전 순으로 목표 K원을 나눠주면 된다.

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;


public class Main {
    public static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args) throws Exception {
        StringTokenizer st = new StringTokenizer(br.readLine());

        int N = Integer.parseInt(st.nextToken());
        int K = Integer.parseInt(st.nextToken());

        int[] coins = new int[N];
        for (int i = 0; i < N; i++) {
            coins[i] = Integer.parseInt(br.readLine());
        }

        int usedCoin = 0;
        int remainWon = K;
        for (int i = N - 1; i >= 0; i--) {
            usedCoin += remainWon / coins[i];
            remainWon = remainWon % coins[i];
        }
        System.out.println(usedCoin);
    }
}