[백준] 동전 0 (11047)(Kotlin)

원본 문제 : https://www.acmicpc.net/problem/11047

 

<첫번째>

import java.util.*

fun main() {
    val sc: Scanner = Scanner(System.`in`)

    val N: Int = sc.nextInt()
    val AIM: Int = sc.nextInt()

    var coinList: IntArray = IntArray(N)
    for (i in 0 until N) {
        coinList[i] = sc.nextInt()
    }

    coinList.sortDescending()

    var cnt: Int = 0
    var sum: Int = 0
    for (i in 0 until N) {
        while (true) {
            if (coinList[i] < AIM) {
                if (coinList[i] + sum <= AIM) {
                    sum += coinList[i]
                    cnt++
                }
                if (coinList[i] + sum > AIM) break
            }
            if (coinList[i] >= AIM) break
        }
        if (sum == AIM) break
    }
    println(cnt)
}