11047번

11047번

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

int main() {
	int n, k, resultCnt = 0;
	vector<int> coins;
	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		int coin;
		cin >> coin;
		coins.push_back(coin);
	}
	for (int i = coins.size() - 1; i >= 0; i--) {
		if (k < coins[i]) continue;
		int tmpCnt = k / coins[i];
		resultCnt += tmpCnt;
		k = k - (coins[i] * tmpCnt);
		if (k == 0) break;
	}
	cout << resultCnt;
}