[백준 11047] 동전 0 (Greedy) (C/C++)

#include <iostream>
#include <algorithm>
using namespace std;
 
int main(void)
{
//    freopen("B11047_input.txt", "r", stdin);
    
    int N, sum;
    int coin[10];
    int ans = 0;
    
    cin >> N >> sum;
    
    for(int i = 0; i < N; i++)
    {
        cin >> coin[i];
    }
    
    sort(coin, coin+N, greater<int>());
 
    int coinIdx = 0;
    while(sum > 0)
    {
        if(sum >= coin[coinIdx])
        {
            sum -= coin[coinIdx];
            ans++;
        }
        else
        {
            coinIdx++;
        }
    }
    
    cout << ans;
    
    return 0;
}