hdu1864最大报销额 01

先把小数乘100变成整数然后处理每个发票里面可以报销的

最后自底向上DP

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;

int dp[];

int main()
{
    char ch;
    double x,y;
    int sum,a,b,c,money[],v;
    int t,i,j,k;
    while(~scanf("%lf%d",&x,&t),t)
    {
        sum = (int)(x*);
        memset(money,,sizeof(money));
        memset(dp,,sizeof(dp));
        int l = ;
        for(i = ; i<t; i++)
        {
            scanf("%d",&k);
            a = b = c = ;
            int flag = ;
            while(k--)
            {
                scanf(" %c:%lf",&ch,&y);
                v = (int)(y*);
                if(ch == 'A' && a+v<=)
                    a+=v;
                else if(ch == 'B' && b+v<=)
                    b+=v;
                else if(ch == 'C' && c+v<=)
                    c+=v;
                else
                    flag = ;
            }
            if(a+b+c<= && a<= && b<= && c<= && flag)
                money[l++] = a+b+c;
        }
        for(i = ; i<=l; i++)
        {
            for(j = sum; j>=money[i]; j--)
                    dp[j] = max(dp[j],dp[j-money[i]]+money[i]);
        }
        printf("%.2lf\n",dp[sum]/100.0);
    }

    return ;
}