HDU 1864 —— 最大报销额 01背包

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxv = 3000000+10;
int dp[maxv];
float q;
int n;
int a[35];

int main()
{
while(~scanf("%f%d", &q, &n))
{
if(n == 0)	break;
int cnt = 0;
memset(a, 0, sizeof a);
memset(dp, 0, sizeof dp);
for(int i = 1;i<=n;i++)
{
bool flag = true;
int x;
scanf("%d", &x);
double suma = 0, sumb = 0, sumc = 0;
while(x--)
{
getchar();
char c;
float k;
scanf("%c:%f", &c, &k);
if(c == 'A')	suma += k;
else if(c == 'B')	sumb += k;
else if(c == 'C')	sumc += k;
else	flag = false;

}
if(flag && suma <= 600 && sumb <=600 && sumc <= 600)
a[cnt++] = (suma+sumb+sumc)*100*1.0;
}
int sum = q*100*1.0;
for(int i = 0;i<cnt;i++)
{
for(int j = sum;j>=a[i];j--)
dp[j] = max(dp[j], dp[j-a[i]]+a[i]);
}
printf("%.2f\n", (float)dp[sum]/100);
}
return 0;
}