传送门:QAQ
题意:有10,20,50,100的纸币,问你买下一堆物品的任意一个至少要有多少张纸币。
思路:因为10,20,20,50就能涵盖100以内所有的数,所以实际上我们只要枚举每张纸币的数量(这里要确保每种情况都能枚举到,所以要好好选枚举的每张纸币的数量),然后简单dpcheck即可(我们要确定一个数值最多要用几张100,因为枚举的纸币也可能组成100,所以注意这个即可)。
附上代码:
#include<cstdio>
#include<map>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
int ax[110];
int n;
map<int, int>mp;
int dp[50];
int v[20];
int num = 0;
int solve(int a, int b, int c) {
int maxn = a * 1 + b * 2 + c * 5;
for (int i = 0; i <= maxn; i++) {
dp[i] = 0;
}
dp[0] = 1;
int tot = 0;
for (int i = 1; i <= a; i++) v[tot++] = 1;
for (int i = 1; i <= b; i++) v[tot++] = 2;
for (int i = 1; i <= c; i++) v[tot++] = 5;
for (int i = 0; i < tot; i++) {
for (int z = maxn; z >= v[i]; z--) {
dp[z] = dp[z] | dp[z - v[i]];
}
}
int yy = -1;
for (int i = 0; i < num; i++) {
int a1 = ax[i] % 10;
int b1 = ax[i] / 10;
if (a1 > maxn) return -1;
int maxx = inf;
if (dp[a1]) maxx = min(b1, maxx);
while (a1 + 10 <= maxn && b1 > 0) {
b1--;
a1 += 10;
if (dp[a1]) maxx = min(maxx, b1);
}
if (maxx == inf) return -1;
yy = max(yy, maxx);
}
return yy + a + b + c;
}
int main(void) {
int t;
scanf("%d", &t);
while (t--) {
mp.clear();
num = 0;
scanf("%d", &n);
int flag = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &ax[i]);
if (ax[i] % 10 != 0) {
flag = 1;
}
ax[i] = ax[i] / 10;
}
if (flag) {
printf("-1\n");
continue;
}
for (int i = 0; i < n; i++) {
if (mp.count(ax[i]) == 0) {
ax[num] = ax[i];
num++;
mp[ax[i]] = 1;
}
}
int ans = inf;
for (int i = 0; i <= 4; i++) {
for (int z = 0; z <= 4; z++) {
for (int j = 0; j <= 2; j++) {
int cnt = solve(i, z, j);
if (cnt == -1) continue;
else {
ans = min(ans, cnt);
}
}
}
}
printf("%d\n", ans);
}
}