1068. Find More Coins (30)解题报告

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;

const int N = 10010;
const int M = 110;

bool comp(int i1, int i2);

bool choice
[M] = { { false } }, flag
= { false };
int c
= { 0 }, dp[M] = { 0 };

int main(void) {
int n, m, i, j, num;

scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", c + i);
}
sort(c + 1, c + n + 1, comp);
for (i = 1; i <= n; i++) {
for (j = m; j >= c[i]; j--) {
if (dp[j] <= dp[j - c[i]] + c[i]) {
dp[j] = dp[j - c[i]] + c[i];
choice[i][j] = true;
}
}
}
if (dp[m] != m) {
puts("No Solution");
}
else {
j = m;
num = 0;
for (i = n; i > 0; i--) {
if (choice[i][j]) {
flag[i] = true;
num++;
j -= c[i];
}
}
for (i = n; i > 0; i--) {
if (flag[i]) {
printf("%d", c[i]);
num--;
if (num) {
putchar(' ');
}
}
}
putchar('\n');
}
return 0;
}

bool comp(int i1, int i2) {
return i1 > i2;
}