1.假设有1元、5元、10元、50元、100元的纸币分别c0,c1,c2,c3,c4张。现在要用这些钱来支付K元,至少要用多少张纸币。无解时输出-1。(贪婪算法)
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 5;
int min(int num1, int num2);
int value[N] = {
1,5,10,50,100 };
int giveChange(int moneyCount[], int K)
{
int num = 0;
for (int i = N - 1; i >= 0; i--)
{
int c = min(K / value[i], moneyCount[i]);
K = K - c * value