最少的硬币个数(背包问题)

• 题意：求刚好满足m的需要最少硬币的个数
• 先将除0之外的dp数组初始化最大值
• 这样就可以刚刚好。。。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int Max = 10000;
int a[105];
int dp[1005];
bool cmp(int a,int b){
	return a > b;
}
int main(){
	ios::sync_with_stdio(false);
	int n, m;
	while(cin >> n >> m){
		for(int i = 1; i <= n; i ++)
			cin >> a[i];
		for(int i = 1; i <= m; i ++)
			dp[i] = Max;
		for(int i = 1; i <= n; i ++)
			for(int j = a[i]; j <= m; j ++)
			dp[j] = min(dp[j],dp[j-a[i]] + 1);
		if(dp[m] == Max)cout << -1 << endl;
		else cout << dp[m] << endl;
	}
    return 0;
}