90WA，求调

#include<bits/stdc++.h>
using namespace std;
const int N = 1e4+5;
int n, k;
int a[N], dp[N];
int main() {
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= k; i++){
    	dp[i] = INT_MAX;
		for(int j = 1; j <= n; j++){
			if(i-a[j] < 0) continue;
			dp[i] = min(dp[i], dp[i-a[j]]+1);
		}
		if(dp[i] == INT_MAX) dp[i] = 0;
	}
	cout << dp[k];
    return 0;
}