王道计算机机试练习——01背包

#include<stdio.h>
#define INF 0x7fffffff
int max(int a, int b) { return a > b ? a : b; }
struct E {
	int w;//物品的体积
	int v;//物品的价值
}list[101];
int dp[101][1001];
int main() {
	int s, n;
	while (scanf("%d%d", &s, &n) != EOF) {
		for (int i = 1; i <= n; i++) {
			scanf("%d%d", &list[i].w, &list[i].v);
		}
		for (int i = 0; i <= s; i++) {
			dp[0][i] = 0;
		}
		for (int i = 1; i <= n; i++) {
			for (int j = s; j >= list[i].w; j--) {
				dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - list[i].w] + list[i].v);
			}
			for (int j = list[i].w - 1; j >= 0; j--)
				dp[i][j] = dp[i - 1][j];
		}
		printf("%d\n", dp[n][s]);
	}
	return 0;
}