[백준] 11047번: 동전 0

11047번: 동전 0

 

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

int solution(vector<int>coin, int money) {
	int num = 0;
	int idx= coin.size() - 1;
	for (;;) {
		if (money == 0) break;
		if (coin[idx] <= money) {
			num += money / coin[idx];
			money %= coin[idx];
		}
		idx--;
	}
	return num;
}


int main() {
	
	vector<int>coin;
	int n = 0, money = 0;
	
	cin >> n >> money;
	for (int i = 0, c=0;i < n;i++) {
		cin >> c;
		coin.push_back(c);
	}
	cout<<solution(coin, money);

}