[Algorithm /백준] 동전 0

[문제]
준규가 가지고 있는 동전은 총 N종류이고, 각각의 동전을 매우 많이 가지고 있다.

동전을 적절히 사용해서 그 가치의 합을 K로 만들려고 한다. 이때 필요한 동전 개수의 최솟값을 구하는 프로그램을 작성하시오.

[입력]
첫째 줄에 N과 K가 주어진다. (1 ≤ N ≤ 10, 1 ≤ K ≤ 100,000,000)

둘째 줄부터 N개의 줄에 동전의 가치 Ai가 오름차순으로 주어진다. (1 ≤ Ai ≤ 1,000,000, A1 = 1, i ≥ 2인 경우에 Ai는 Ai-1의 배수)

[출력]
첫째 줄에 K원을 만드는데 필요한 동전 개수의 최솟값을 출력한다.

 

 

[문제 해결]

package secondWeek;

import java.util.Scanner;

public class Coin0 {

public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Coin0 co = new Coin0();
		
		int N = sc.nextInt();
		int totalMoney = sc.nextInt();
		
		int []nArr = new int[N];
		
		for(int i = 0 ; i<nArr.length; i++) {
			nArr[i] = sc.nextInt();
		}
		int data = co.greedy(totalMoney, nArr);
		System.out.println(data);
		
	}
	public int greedy(int totalMoney, int[] arr) {
		int count = 0;
		
		for(int i = arr.length-1; i> -1; i--) {
			if(totalMoney >= arr[i]) {	
				 int div = totalMoney/arr[i];
				 totalMoney = totalMoney - div * arr[i];
				 count +=div;
			}
			if(totalMoney == 0)
				break;
		}
	
	   return count;
	}

}