HDU-1864-最大报销额

#include <iostream>
#include <memory.h>
#include <vector>
#include <map>
#include <algorithm>
#include <cstdio>
#include <math.h>

using namespace std;

typedef long long LL;

const int MAXN = 30 + 10;

int dp[MAXN * 1000 * 100];
int A[MAXN];

int main()
{
    double q;
    int v, n;
    while (~scanf("%lf%d", &q, &n))
    {
        memset(dp, 0, sizeof(dp));
        if (!n)
            break;
        v = (int)(q * 100);
        int cnt = 0;
        for (int i = 1;i <= n;i++)
        {
            int t;
            int a, b, c;
            a = b = c = 0;
            double cost;
            char type;
            int flag = 1;
            scanf("%d", &t);
            for (int j = 1;j <= t;j++)
            {
                scanf(" %c:%lf", &type, &cost);
                if (type != ‘A‘ && type != ‘B‘ && type != ‘C‘)
                    flag = 0;
                if (type == ‘A‘)
                    a += (int)(cost * 100);
                if (type == ‘B‘)
                    b += (int)(cost * 100);
                if (type == ‘C‘)
                    c += (int)(cost * 100);
            }
            if (a + b + c > 1000 * 100)
                flag = 0;
            if (a > 600 * 100 || b > 600 * 100 || c > 600 * 100)
                flag = 0;
            if (flag)
                A[++cnt] = a + b + c;
        }

        for (int i = 1;i <= cnt;i++)
        {
            for (int j = v;j >= A[i];j--)
                dp[j] = max(dp[j], dp[j - A[i]] + A[i]);
        }
        printf("%.2lf\n", dp[v] / 100.0);

    }


    return 0;
}