HDU_1864_01背包

http://acm.hdu.edu.cn/showproblem.php?pid=1864

题目好像是输入的数据都是两位小数，先统计能报销的发票，然后把小数*100变成成熟就是01背包问题了。

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>

using namespace std;

double total;
int n;
int dp[];
int main()
{
    while(~scanf("%lf%d,&total",&total,&n) && n)
    {
        memset(dp,,sizeof(dp));
        int counts = ,ans[] = {};
        while(n--)
        {
            int num,flag = ;
            double all[] = {};
            scanf("%d",&num);
            while(num--)
            {
                getchar();
                char c;
                double temp;
                scanf(" %c:%lf",&c,&temp);
                if(c != 'A' && c != 'B' && c != 'C')
                {
                    flag = ;
                    break;
                }
                all[c-'A'] += temp;
            }
            if(flag && all[] < +1e- && all[] < +1e- && all[] < +1e-)
            {
                ans[counts++] = (int)(*all[]+*all[]+*all[]);
            }
        }
        for(int i = ;i < counts;i++)
        {
            for(int j = (int)(total*);j >= ans[i];j--)
            {
                dp[j] = max(dp[j],dp[j-ans[i]]+ans[i]);
            }
        }
        printf("%.2f\n",(double)dp[(int)(total*)]/);
    }
    return ;
}