[Java][그리디 알고리즘] 백준 11047 동전 0

package codinginterview;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class BJ11047 {

public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer(br.readLine());

    int n = Integer.parseInt(st.nextToken());
    int k = Integer.parseInt(st.nextToken());
    int[] coin = new int[n];
    int min =0;
    int m =0;

    for(int i=0; i<n; i++) {
        coin[i] = Integer.parseInt(br.readLine());    
    }

    for(int i=n-1; i>=0; i--) {
        if(k / coin[i] < 0) {
             continue;
        }else {
            m = k / coin[i];
            min += m ; 
            k = k - (coin[i] * m); 
        }
    }

    System.out.println(min);
}

}

이번에도 쉬운 문제였네요
이런 문제만 코테에 나왔으면......
그럼 이만...