hdu 2159 FATE dp

设dp【i】【j】表示还有i忍耐度和j只怪可以杀时，获得的最大经验。由于怪物可以无限杀，做一下完全背包即可。最后扫一边二维dp求答案。

#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 120;

int dp[N][N];
int n, m, k, s;
int v[N], w[N];

int main()
{
	while( ~scanf("%d%d%d%d", &n, &m, &k, &s) ) {
		memset( dp, 0, sizeof( dp ) );
		for( int i = 1; i <= k; ++i ) {
			scanf("%d%d", &v[i], &w[i]);
		}
		for( int i = 1; i <= k; ++i ) {
			for( int j = w[i]; j <= m; ++j ) {
				for( int o = s; o >= 1; --o ) {
					dp[j][o] = max( dp[j][o], dp[j-w[i]][o-1] + v[i]);
				}
			}
		}
		if( dp[m][s] < n )
			puts("-1");
		else {
			int pp = 0;
			for( int i = 0; i <= 100; ++i ) {
				for( int j = 0; j <= 100; ++j )
					if( dp[i][j] >= n && m-i > pp )
						pp = m-i;
			}
			printf("%d\n", pp);
		}
	}
	return 0;
}