【背包总结】【交换维度】

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;
    
int n,tot;
const int N = 10;
const int M = 1000;
int dp[M]; //价值之和
int m[M + 1];
int v[N];
int w[N];
int main()
{
    while(scanf("%d%d",&n,&tot) != EOF)
	{
		memset(dp,0x3f3f3f3f,sizeof(dp));
		memset(m,0,sizeof(m));
		dp[0] = 0;
		int sum = 0;
		for(int i=0;i<n;i++)
		{
		   scanf("%d%d",&w[i],&v[i]);
		   sum += v[i];
		}
		for(int i=0;i<n;i++)
		{
			for(int j=sum;j>=v[i];j--)
			{
				dp[j] = min(dp[j-v[i]]+w[i],dp[j]);			
			}

		}
	
		while(dp[sum] > tot) sum--;
		cout << sum << endl;
	}
    return 0;
}