题解

#include <iostream>
#include <vector>
#include <climits>
using namespace std;

int main() {
    int n, w;
    cin >> n >> w;

    vector<int> coins(n);
    for (int i = 0; i < n; ++i) {
        cin >> coins[i];
    }
    vector<int> dp(w + 1, INT_MAX);
    dp[0] = 0; 

    for (int coin : coins) {
        for (int j = coin; j <= w; ++j) {
            if (dp[j - coin] != INT_MAX) {
                dp[j] = min(dp[j], dp[j - coin] + 1);
            }
        }
    }

    cout << dp[w] << endl;

    return 0;
}