11047번 동전 0

그리디(탐욕) 알고리즘

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

#include <iostream>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
 
using namespace std;
 
int Coin[10] = { 0, };
 
int N = 0, K = 0;
 
int Search()
{
    int total = K;
 
    int ret = 0;
 
    for (int i = N - 1; i >= 0; i--)
    {
        while (total - Coin[i] >= 0)
        {
            total -= Coin[i];
 
            ++ret;
 
            if (total <= 0) break;
        }
    }
 
    return ret;
}
 
int main(void)
{
    scanf("%d %d", &N, &K);
 
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &Coin[i]);
    }
 
    printf("%d\n", Search());
    
    return 0;
}