c++ 01 完全 背包

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
int N, V;
int W[20];
int Value[20];
int f[20];
 
int main()
{
	scanf("%d%d", &N, &V);   //必须要选择最大的
	int ans = -1;
	cout << u << endl;
	for (int i = 1; i <= N; i++) {
		cin >>W[i]>>Value[i];
	}
 
	//f初始赋值为0  
	for (int i = 0; i <= V; i++) {
		f[i] =0;
	}
    
	// 01背包，逆推
	for (int i = 1; i <= N; i++) {
		for (int j = V; j >=W[i]; j--) {
			f[j] = max(f[j], f[j - W[i]] + Value[i]);
		}
	
	}
	/*
	完全背包，顺推
	for (int i = 1; i <= N; i++) {
		for (int j =W[i]; j <= V; j++) {
			  f[j] = max(f[j], f[j - W[i]] + Value[i]);
		}
	}*/
 
	cout<<f[V]<<endl;  //最大的为f[v]
	return 0;
}

背包九讲：https://blog.csdn.net/yandaoqiusheng/article/details/84782655