36 篇文章 0 订阅

# 题目

“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角，凑不成则输出-1。
• 最大：用对立反面来求，用最小张数凑成它的反面，那么剩余张数就是凑成p的最大张数。设所有纸币组成总价值sum和纸币总数cnt，用上一点求凑成(sum-p)最小张数x，cnt-x即可。

## 代码

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1000006;
int t, p, a, b = { 1,5,10,50,100 };
int mi, ma, sum, cnt, fp, ti;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d%d%d%d%d%d", &p, &a, &a, &a, &a, &a);
mi = ma = sum = cnt = 0;
for (int i = 0; i <= 4; i++) {
sum += b[i] * a[i];//纸币总价值
cnt += a[i];//纸币总数
}
fp = sum - p;
for (int i = 4; i >= 0; i--) {
ti = p / b[i];//最多换b[i]面值几张
if (ti > a[i])ti = a[i];//超过题目输入张数
mi += ti;
p -= ti * b[i];
}
if (p) {
printf("-1 -1\n");
continue;
}
for (int i = 4; i >= 0; i--) {
ti = fp / b[i];
if (ti > a[i])ti = a[i];
ma += ti;
fp -= ti * b[i];
}
printf("%d %d\n", mi, cnt - ma);
}
return 0;
}


04-22 1329
04-21 78                                                                          01-19 265
01-24 166
03-15 398
10-03 42
03-12 293
03-03 590
03-16 1243
03-12 314
04-19 1031
03-12 478
03-21 575
03-26 205
03-26 443
03-21 421
03-29 184 点击重新获取   扫码支付  余额充值