FATE HDU - 2159

Last Edited: Feb 21, 2019 6:20 PM
Tags: dynamic programming,hdu, knapsack problem

第一维是忍耐度,第二维是杀怪数量，每次枚举杀了几只

#include<bits/stdc++.h>
using namespace std;
#define fst first
#define sec second
#define sci(num) scanf("%d",&num)
#define scl(num) scanf("%lld",&num)
#define mem(a,b) memset(a,b,sizeof a)
#define cpy(a,b) memcopy(a,b,sizeof b)
typedef long long LL;
typedef pair<int,int> pair;
const int MAX_N = 110;
int dp[MAX_N][MAX_N];
int n,m,k,s;
int a[200],b[200];
int main() {
    while (~scanf("%d%d%d%d",&n,&m,&k,&s)) {
        //sci(n); sci(m); sci(k); sci(s);
        for (int i = 0;i < k;i++)
            sci(a[i]),sci(b[i]);
        mem(dp,0);
        for (int i = 1;i <= m;i++) {
            for (int ns = 0;ns < k;ns++) {
                if (i < b[ns]) continue;
                for (int j = 1;j <= s;j++) {
                    dp[i][j] = max(dp[i][j],dp[i - b[ns]][ j - 1] + a[ns]);
                }
            }
        }
        int ans = -1;
        for (int i = 1;i <= m && ans == -1;i++) {
            for (int j  = 1;j <= s && ans == -1;j++) {
                if (dp[i][j] >= n) {
                    ans = m - i;
                    break;
                }
            }
        }
        printf("%d\n",ans);


    }

    return 0;
}