POJ - 2184 Cow Exhibition(01背包)

题目大意：有N个牛，给出每头牛的兴奋度和幽默感，问如何挑选牛，才能使得兴奋度＋幽默感的和达到最大，且使兴奋感的和，幽默感的和非负

解题思路：01背包问题，不过这题要排一下序，我是按兴奋度从大到小排序的，这样能保证非负
用dp[i]表示兴奋度为i时，幽默感能达到的最大值

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define abs(x)((x)>0?(x):(-(x)))
const int N = 110;
const int MAX = 100010;
const int INF = 0x3f3f3f3f;

struct Cows{
    int s, f;
}cows[N];

int n, Sum, cnt;
int dp[MAX];

bool cmp(const Cows &a, const Cows &b) {
    return a.s > b.s;
}

void init() {
    Sum = cnt = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d%d", &cows[i].s, &cows[i].f);
        if (cows[i].s >= 0) cnt++;
        Sum += abs(cows[i].s);
    }
    sort(cows, cows + n, cmp);
}

void solve(){ 
    for (int i = 1; i <= Sum; i++)
        dp[i] = -INF;

    dp[0] = 0;
    for (int i = 0; i < cnt; i++)
        for (int j = Sum - cows[i].s; j >= 0; j--) 
            if (dp[j] != -INF)
                dp[j + cows[i].s] = max(dp[j + cows[i].s], dp[j] + cows[i].f);

    for (int i = cnt; i < n; i++)
        for (int j = -cows[i].s; j <= Sum; j++)
            if (dp[j] != -INF) 
                dp[j + cows[i].s] = max(dp[j + cows[i].s], dp[j] + cows[i].f);

    int ans = 0;
    for (int i = 0; i <= Sum; i++)
        if (dp[i] >= 0) ans = max(ans, i + dp[i]);

    printf("%d\n", ans);
}

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