01背包

最基础的DP

#include "iostream"
#include "cstdio"
#include "string"
using namespace std;
#define MAXN 222222
int c[MAXN],v[MAXN];
int dp[MAXN];
int main()
{
    int n,C;
    cin >> n >> C;
    for (int i = 0;i < n; ++ i)
        cin >> c[i] >> v[i];
    for (int i = 0;i < n ; ++ i)
        for (int w = C;w >= 0 ; -- w)
            if (w-c[i] >= 0)
            dp[w] = max(dp[w],dp[w-c[i]] + v[i]);
    cout << dp[C] << endl;
    return 0;
}