[C++] 백준11047: 동전 0

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

int main() {
	int n, k, l, count = 0;
	vector<int> remains;
	cin >> n >> k;

	if (n < 1 || n > 10) return false;
	if (k < 1 || n > 100000000) return false;

	for (int i = 0; i < n; i++) {
		cin >> l;
		remains.push_back(int(l));
	}


	for (int index = remains.size() - 1; index >= 0; index--) {
		while (k >= remains[index]) {
			k -= remains[index];
			count++;
		}
	}
	cout << count;
}