0-1背包问题

#include<stdio.h>
#include<algorithm>
using namespace std;
int max(int a, int b)
{
	return (a > b ? a : b);
}
struct T
{
	int V;
	int price;
}list[101];
int dp[101][1001];
int main()
{
	int t, n;
	while (scanf("%d%d", &t, &n) != EOF)
	{
		for (int i = 1; i <= n; i++)
			scanf("%d%d", &list[i].V, &list[i].price);
		for (int i = 0; i <= t; i++)
			dp[0][i] = 0;
		for (int i = 1; i <= n; i++)
		{
			for (int j = 0; j < list[i].V; j++)
				dp[i][j] = dp[i - 1][j];
			for (int j = list[i].V; j <= t; j++)
				dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - list[i].V] + list[i].price);
		}
		printf("%d", dp[n][t]);
	}
	return 0;
}

更简单化

#include<stdio.h>
#include<algorithm>
using namespace std;
int max(int a, int b)
{
	return (a > b ? a : b);
}
struct T
{
	int V;
	int price;
}list[101];
int dp[1001];
int main()
{
	int t, n;
	while (scanf("%d%d", &t, &n) != EOF)
	{
		for (int i = 1; i <= n; i++)
			scanf("%d%d", &list[i].V, &list[i].price);
		for (int i = 0; i <= t; i++)
			dp[i] = 0;
		for (int i = 1; i <= n; i++)
		{
			for (int j = t; j >= list[i].V; j--)
				dp[j] = max(dp[j], dp[j - list[i].V] + list[i].price);
		}
		printf("%d", dp[t]);
	}
	return 0;
}

注意0-1背包问题不能用贪心算法求解。
例：总容量为5。
物品一: V=1,price=1 P/V=1
物品二: V=2,price=3 P/V=1.5
物品三: V=3,price=4.5 P/V=1.5
物品四: V=4,price=6.4 P/V=1.6