[JAVA] Baekjoon 그리디 알고리즘 11047번 : 동전 0

 

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

package Greedy_2번_동전0;   import java.util.Scanner;   public class Main {       public static void main(String[] args) {                  int coin = 0;    //동전의 갯수 n         int sum = 0; //가치의 합 k         int coin_sum = 0; //가치의 합과 비교할 값         int min = 0; //동전 개수의 최솟값                          Scanner sc = new Scanner(System.in);                  coin = sc.nextInt();         sum = sc.nextInt();                  int [] coinArr = new int [coin];                  for(int i=0;i<coin;i++) {             coinArr[i] = sc.nextInt();         }                  for(int i=coinArr.length-1;i>=0;i--) {             while(true) {                 if(coin_sum+coinArr[i] <= sum) {                     coin_sum += coinArr[i];                      min++;                 }                 else {                     break;                 }             }         }         System.out.println(min);         sc.close();     } }