【背包总结】【输出最优解时候的最小数量】

#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 + 1];
int m[M + 1];
int v
;
int w
;
int main()
{
    while(scanf("%d%d",&n,&tot) != EOF)
	{
		memset(dp,0,sizeof(dp));
		memset(m,0,sizeof(m));
		for(int i=0;i<n;i++)
		{
		   scanf("%d%d",&w[i],&v[i]);
		}
		for(int i=0;i<n;i++)
		{
			for(int j=tot;j>=w[i];j--)
			{
				if(dp[j] == dp[j-w[i]] + v[i])
				{
				    if(m[j-w[i]] + 1 < m[j])
					{
						m[j] = m[j-w[i]] + 1;
					}
				}
				else if(dp[j] < dp[j-w[i]] + v[i])
				{
					dp[j] = dp[j-w[i]] + v[i];
					m[j] = m[j-w[i]] + 1;
				}
				else
				{

				}
			}

		}
		cout << m[tot] << endl;
	}
    return 0;
}

#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 + 1];
int m[M + 1];
int v
;
int w
;
int main()
{
    while(scanf("%d%d",&n,&tot) != EOF)
	{
		memset(dp,0,sizeof(dp));
		memset(m,0,sizeof(m));
		for(int i=0;i<n;i++)
		{
		   scanf("%d%d",&w[i],&v[i]);
		}
		for(int i=0;i<n;i++)
		{
			for(int j=tot;j>=w[i];j--)
			{
			
				if(dp[j] < dp[j-w[i]] + v[i] || dp[j] == dp[j-w[i]] + v[i] && m[j] > m[j-w[i]] + 1)
				{
					dp[j] = dp[j-w[i]] + v[i];
					m[j] = m[j-w[i]] + 1;
				}
			
			}

		}
		cout << m[tot] << endl;
	}
    return 0;
}