백준 11047번 : 동전 0

문제 링크 : www.acmicpc.net/problem/11047

내 풀이(2021.1.8.) :

#include <iostream>

using namespace std;

int money[10];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N, K; cin >> N >> K;
	for (int i = 0; i < N; i++) {
		cin >> money[i];
	}

	int cnt = 0;
	for (int i = N - 1; i >= 0; i--) {
		while (K - money[i] >= 0) {
			K -= money[i];
			cnt++;
		}
	}

	cout << cnt;

	return 0;
}