POJ - 3260 The Fewest Coins (完全背包)

题目大意：有N种硬币，给出每种硬币的价值和数量
现在要买一样东西，东西的价值为W，要求用最少的硬币去买

解题思路：先排序，从小到达排序，然后进行完全背包，背包的时候用另一个数组纪录一下该硬币已经用了多少个了

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
const int T = 120010;
const int INF = 0x3f3f3f3f;

struct Coin{
    int val, num;
}C[N];

int n, t;
int used[T], dp[T];

bool cmp(const Coin &a, const Coin &b) {
    return a.val < b.val;
}

void init() {
    for (int i = 0; i < n; i++)
        scanf("%d" ,&C[i].val);

    for (int i = 0; i < n; i++)
        scanf("%d", &C[i].num);
    sort(C, C + n, cmp);
}

void solve() {
    memset(dp, 0x3f, sizeof(dp));
    dp[0] = 0;

    for (int i = 0; i < n; i++)  {
        memset(used, 0, sizeof(used));
        for (int j = C[i].val; j < T; j++)
            if (dp[j] > dp[j - C[i].val] + 1 && dp[j - C[i].val] != INF && used[j - C[i].val] < C[i].num) {
                dp[j] = dp[j - C[i].val] + 1;
                used[j] = used[j - C[i].val] + 1;
            }
    }

    for (int i = 0; i < n; i++)
        for (int j = T - C[i].val - 1; j >= 0; j--)
            dp[j] = min(dp[j], dp[j + C[i].val] + 1);

    if (dp[t] != INF) printf("%d\n", dp[t]);
    else printf("-1\n");
}

int main() {
    while (scanf("%d%d", &n, &t) != EOF) {
        init();
        solve();
    }
    return 0;
}