[BOJ] 11047 제출

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int N, K;

    std::cin >> N >> K;

    std::vector<int> coins(N);

    for (int i = 0; i < N; ++i) {
        std::cin >> coins[i];
    }

    std::sort(coins.rbegin(), coins.rend());

    int count = 0;

    for (int i = 0 ; i < N ; ++i) {
        if (0 == K) break;
        if (coins[i] <= K) {
            count += K / coins[i];
            K %= coins[i];
        }
    }

    std::cout << count << std::endl;

    return 0;
}