[백준] 11047 동전0 Python C++

n, k = map(int, input().strip().split())
inputs = []
cnt = 0
point = 0
temp = 0
 
for i in range(n):
    temp = int(input())
    inputs.append(temp)
    if temp < k:
        point = inputs.index(temp)
 
for j in range(point,-1,-1):
    temp = 0
    if k <= 0:
        break
    if inputs[j] <= k:
        #print("k: %d inputs[k]: %d" % (k, inputs[j]), end=" ")
        temp = k//inputs[j]
        #print("temp: %d" % temp, end =" ")
        cnt += temp
        #print("cnt: %d" % cnt, end=" ")
        k = k%inputs[j]
        #print("k: %d" % k)
print(cnt)

 

 

#include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <list>
#include <array>
#include <vector>
#include <map>
#include <cmath>
 
using namespace std;
    
int main(){
 
    int n = 0, k = 0, cnt=0, point=0, temp;
    cin >> n >> k;
    
    int *inputs = new int[n];
 
    for (int i = 0; i < n; i++){
        cin >> *(inputs + i);
        if (k >= *(inputs + i))
            point = i;
        //cout << point << '\n';
    }
 
    for (int i = point; i >= 0; i--){
        temp = 0;
        
        if (k == 0)
            break;
 
        if (k >= *(inputs + i)){
            //cout << "k: " << k << "*(inputs + i)" << *(inputs + i) << " ";
            temp = (int)k / *(inputs + i);
            //cout << "temp: " << temp << " ";
            cnt += temp;
            //cout << "cnt: " << cnt << " ";
            k = (int)k % *(inputs + i);
            //cout << "k: " << k << "\n";
        }
    }
    cout << cnt << '\n';
    
    return 0;
}