有1元,5元,10元,50元,100元,500元的硬币各C1,C5,C10,C50,C100,C500枚。现在要用这些硬币来支付A元,最少需要多少枚硬币?
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
const int value[6] = { 1, 5, 10, 50, 100, 500 };//硬币面值
int a, c[6], cnt = 6;//硬币个数
int n, balance, countt;
void solve()
{
for (int i = cnt - 1; i >= 0;i--)
{
n = min(balance / value[i], c[i]);
balance = balance - value[i] * n;
countt += n;
}
}
int main()
{
for (int i = 0; i < cnt; i++)
{
scanf_s("%d", &c[i]);
}
scanf_s("%d", &a);
balance = a;
solve();
printf("%d\n", countt);
return 0;
}