-
백준 11047번 C++풀이카테고리 없음 2018. 10. 31. 08:28반응형
#include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
int coin[11];
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int n, k;
int answer =0;
cin >> n >> k;
for (auto i=0; i<n; i++){
cin >> coin[i];
}
int iterator = n-1;
while ( k != 0){
if (k >= coin[iterator]){
answer += k / coin[iterator];
k %= coin[iterator];
}
iterator--;
}
cout << answer;
}반응형