Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 104 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=104, the total number of coins) and M(<=102, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in one line the face values V1 <= V2 <= ... <= Vk such that V1 + V2 + ... + Vk = M. All the numbers must be separated by a space, and there must be no extra space at the end of the line. If such a solution is not unique, output the smallest sequence. If there is no solution, output "No Solution" instead.
Note: sequence {A[1], A[2], ...} is said to be "smaller" than sequence {B[1], B[2], ...} if there exists k >= 1 such that A[i]=B[i] for all i < k, and A[k] < B[k].
Sample Input 1:8 9 5 9 8 7 2 3 4 1Sample Output 1:
1 3 5Sample Input 2:
4 8 7 2 4 3Sample Output 2:
No Solution
0-1背包问题,用最多数量的价值组成一个数
例如 5 3
1 1 1 1 2
输出应该是1 1 1
只要在输入后对数组从大的到小排序
一样,如果用数量最少组成一个数,那就对数组从小到大排序
最后输出,直接枚举使用的价值
#include <cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
int out[10001],cnt=0;
static int G[10001][1001];
int value[10001];
int n,sum;
int cmp(int a, int b){return a > b;}
void Print()
{
int i = n;//枚举物品
int j = sum;//枚举空间
//cout<<"加入背包的物品编号:"<<endl;
while(i)
{
if (G[i][j] == 1)
{
/*if不满足,表示第i件物品没装入背包,
if条件满足,表示放入背包了*/
out[cnt++]=value[i];
j -= value[i];//此时容量减少
}
i--;
}
}
int main() {
cin>>n>>sum;
for(int i=1;i<=n;i++){
scanf("%d",&value[i]);
}
sort(value+1,value+n+1);
int f[10001];
for(int i=1;i<=n;i++){
for(int j=sum;j>=value[i];j--){
if(f[j]<=f[j - value[i]] + value[i]){
f[j]=f[j - value[i]] + value[i];
G[i][j]=1;
}
}
}
Print();
if(cnt==0||f[sum]!=sum){
cout<<"No Solution";
}
else{
sort(out,out+cnt);
cout<<out[0];
for(int i=1;i<cnt;i++){
cout<<" "<<out[i];
}
}
return 0;
}