Algorithm
[백준-11047번/Java] 동전 0
1984
2022. 11. 17. 15:53
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer stk = new StringTokenizer(br.readLine(), " ");
int N = Integer.parseInt(stk.nextToken());
int K = Integer.parseInt(stk.nextToken());
int[] coinList = new int[N];
int maxCoinIndex = -1;
for (int i = 0; i < N; i++) {
int coin = Integer.parseInt(br.readLine());
if (coin > K) {
break;
}
coinList[i] = coin;
maxCoinIndex = i;
}
int coinCount = 0;
for (int i = maxCoinIndex; i >= 0; i--) {
int coin = coinList[i];
if (K >= coin) {
coinCount += K / coin;
K = K % coin;
}
if (K == 0) {
break;
}
}
System.out.println(coinCount);
}
}
728x90