[PS][그리디]/[BOJ][14247][나무자르기]

boj14247.cpp

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

stack<int> s;
int n, k;
int main(void) { 
	cin >> n >> k;
	int coin;
	for (int i = 0; i < n; i++) {
		cin >> coin;
		s.push(coin);
	}
	int ans = 0;
	while (k) {
		if (k >= s.top()) {
			ans += k / s.top();
			k %= s.top();
		}
		s.pop();
	}
	cout << ans << "\n";
	return 0;
}