hdu 1963 Investment 完全背包

#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#include <set>
#include <queue>
#include <vector>

using namespace std;

typedef long long ll;

const int maxn = 12;
const int maxm = 101000;

int w[maxn], c[maxn];
int f[maxm];
int ans;
int n, V;

void CompletePack(int cost, int weight)
{
    for(int i = cost; i <= V; i+=1000)
    {
        f[i/1000] = max(f[i/1000], f[(i-cost)/1000] + weight);
        if(f[i/1000] > ans)
            ans = f[i/1000];
    }
}

int main()
{
    //freopen("in.txt", "r", stdin);

    int T;
    scanf("%d", &T);
    while(T--)
    {
        int k;
        scanf("%d%d", &V, &k);

        int n;
        scanf("%d", &n);
        for(int i = 0; i < n; i++)
        {
            scanf("%d%d", &c[i], &w[i]);
        }

        for(int i = 0; i < k; i++)
        {
            ans = 0;
            memset(f, 0, sizeof(f));

            for(int j = 0; j < n; j++)
                CompletePack(c[j], w[j]);

            V += ans;
        }

        printf("%d\n", V);
    }

    return 0;
}