BOJ-11047

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

using namespace std;
int cmp(int a, int b) {return (a>b ? a : b);}

int main() {
    ios::sync_with_stdio(false);
    cout.tie(NULL); cin.tie(NULL);
    
	int n, k;
    int ans = 0;
    vector<int> v;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        v.push_back(a);
    }
	sort(v.begin(),v.end(),cmp);
	for (int i = 0; i < n; i++) {
		while (k >= v[i]) {
			ans++;
			k -= v[i];
		}
	}
	cout << ans << endl;
}