求调90分！！！！！

#include <bits/stdc++.h>
using namespace std;
const int N=1e3+5;
int a[N], dp[N], dpw[N];
bool cmp(int a, int b){
	return b < a;
}
int main () {
	int n, w;
	cin >> n >> w;
	for(int i=1; i<=n; i++) {
		cin >> a[i];
	}
	sort(a+1, a+1+n, cmp);
	dp[1] = w/a[1];
	dpw[1] = w-dp[1]*a[1];
	for(int i=2; i<=n; i++) {
			dp[i] = w/a[i];
			dpw[i] = w-dp[i]*a[i];

		for(int j=1; j<=i-1; j++) {
			if(dpw[j] < a[i]) {
				continue;
			} else if(dp[j]+dpw[j]/a[i] < dp[i]) {
					int k=dpw[j]/a[i];
					dp[i] = dp[j]+k;
					dpw[i] = dpw[j]-k*a[i];
				} 
		}
	}
	int small=2147483645;
	for(int i=1; i<=n; i++) {
		if(dp[i] < small && dpw[i] == 0) {
			small = dp[i];
		}
	}
	cout << small;
	return 0;
}