题目大意:现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。
解题思路:先把能报销的取出来,然后进行01背包即可
因为价值是小数,小数位后面最多有两位,那就将其转成整数(扩大100倍),然后再进行背包即可
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
using namespace std;
const int N = 50;
const int M = 3000010;
const double eps = 1e-4;
double q;
int cnt, n;
int val[N], dp[M];
void init() {
cnt = 0;
int t;
double A, B, C, price;
char c;
bool flag;
memset(val, 0, sizeof(val));
for (int i = 0; i < n; i++) {
A = B = C = 0;
scanf("%d", &t);
flag = false;
for (int j = 0; j < t; j++) {
scanf(" %c:%lf", &c, &price);
if (c == 'A' || c == 'B' || c == 'C') {
if (c == 'A') A += price;
else if (c == 'B') B += price;
else if (c == 'C') C += price;
}
else flag = true;
}
//将其转为整数,并提取
int AA = (int)(round(A * 100.0));
int BB = (int)(round(B * 100.0));
int CC = (int)(round(C * 100.0));
if (!flag && AA + BB + CC <= 100000 && AA <= 60000 && BB <= 60000 && CC <= 60000) {
val[cnt++] = AA + BB + CC;
}
}
}
void solve() {
memset(dp, 0, sizeof(dp));
int m = (int)(round(q * 100.0));
for (int i = 0; i < cnt; i++)
for (int j = m; j >= val[i]; j--)
dp[j] = max(dp[j], dp[j - val[i]] + val[i]);
int ans = 0;
for (int i = 0; i <= m; i++)
ans = max(ans, dp[i]);
printf("%.2lf\n", 1.0 * ans / 100.0);
}
int main() {
while (scanf("%lf%d", &q, &n) != EOF && n) {
init();
solve();
}
return 0;
}