贪心算法９之１００５

１　题目编号：１００５　ｐｒｏｂｌｅｍＢ

２　题目内容：

Problem Description

"Yakexi, this is the best age!" Dong MW works hard and get high pay, he has many 1 Jiao and 5 Jiao banknotes(纸币), some day he went to a bank and changes part of his money into 1 Yuan, 5 Yuan, 10 Yuan.(1 Yuan = 10 Jiao)
"Thanks to the best age, I can buy many things!" Now Dong MW has a book to buy, it costs P Jiao. He wonders how many banknotes at least,and how many banknotes at most he can use to buy this nice book. Dong MW is a bit strange, he doesn't like to get the change, that is, he will give the bookseller exactly P Jiao.

 

Input

T(T<=100) in the first line, indicating the case number. T lines with 6 integers each: P a1 a5 a10 a50 a100 ai means number of i-Jiao banknotes. All integers are smaller than 1000000.

 

Output

Two integers A,B for each case, A is the fewest number of banknotes to buy the book exactly, and B is the largest number to buy exactly.If Dong MW can't buy the book with no change, output "-1 -1".

 

Sample Input

  
  

   
   3
33 6 6 6 6 6
10 10 10 10 10 10
11 0 1 20 20 20
  
  

 

Sample Output

  
  

   
   6 9
1 10
-1 -1
  
  

３　解题思路形成过程：最少的数量要用贪心的思想，优先取面值尽量大 的纸币来凑这个价格。因为我们要求的是花的最多数量纸币，所以就是要保证手上的纸币数量最少；假设手上总共有p毛，而价格为q毛，我们用手上最少的数量的纸币去凑（p-q）毛，然后再用总数量减去该最少数量即可。

５　代码：#include <iostream>
#include <stdlib.h>
using namespace std;
int main()
{
int b[10] = { 0, 1, 5, 10, 50, 100 };
int T;
int P, r;
int a[10], c[10], e[10];
int i, k, sum;
cin >> T;
while (T--)
{
sum = 0;
cin >> P;
r = P;
for (i = 1; i <= 5; i++)
{
cin >> a[i];
sum = sum + b[i] * a[i];
}
for (i = 5; i>0; i--)
{
if (r / b[i]<a[i])
{
c[i] = r / b[i];
r = r - b[i] * c[i];
}
else
{
c[i] = a[i];
r = r - c[i] * b[i];
}
}
if (r != 0)
{
cout << -1 << " " << -1 << endl;
}
else
{
k = sum - P;
for (i = 5; i>0; i--)
{
if (k / b[i]<a[i])
{
e[i] = k / b[i];
k = k - b[i] * e[i];
}
else
{
e[i] = a[i];
k = k - e[i] * b[i];
}
}
if (k == 0)
{
cout << (c[1] + c[2] + c[3] + c[4] + c[5]) << " " << (a[1] + a[2] + a[3] + a[4] + a[5] - (e[1] + e[2] + e[3] + e[4] + e[5]) )<< endl;
}
}
}
}