백준 11047번: 동전 0 그리디알고리즘

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

11047번: 동전 0

 

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		
		int n = scan.nextInt();
		int k = scan.nextInt();
		
		int arr[] = new int[n];
		for(int i=0; i<n; i++) {
			arr[i] = scan.nextInt();
		}
		
		int count = 0;
		
		while(k != 0) {
			for(int i=n-1; i>=0; i--) {
				if(arr[i] <= k) {
					k -= arr[i];
					count++;
					break;
				}
			}
		}
		System.out.println(count);
		
	}
}