[C++][백준 11047][그리디 알고리즘] 동전 0 :: seoftware

문제

https://www.acmicpc.net/problem/11047

11047번: 동전 0

소스코드

#include <iostream>
#include <vector>
using namespace std;
int main(void) {
	int n, k;
	cin >> n >> k;
	vector<int> coin;
	for (int i = 0; i < n; i++) {
		int c;
		cin >> c;
		coin.push_back(c);
	}
	int answer = 0;
	while (k!=0) {
		while (coin.back() <= k) {
			k -= coin.back();
			answer++;
		}
		coin.pop_back();
	}
	cout << answer;
}