洛谷P2925 Hay For Sale S動態規劃

題目
動態規劃模板題，價值等於重量

#include <iostream>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;

typedef long long ll;

int C, H;
int V[50010], dp[50010];

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> C >> H;
    for (int i = 1; i <= H; i++) {
        cin >> V[i];
    }
    for (int i = 1; i <= H; i++) {
        for (int j = C; j >= V[i]; j--) {
            dp[j] = max(dp[j], dp[j - V[i]] + V[i]); 
        }
    }
    cout << dp[C] << endl;
    return 0;
}```