P1049 装箱问题

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

int W, n, s[510];
int dp[45010];

int main() {
    cin >> W >> n;
    for (int i = 0; i < n; i++) cin >> s[i];

    for (int i = 0; i < n; i++)
        for (int j = W; j >= s[i]; j--)
            dp[j] = max(dp[j], dp[j - s[i]] + s[i]);

    cout << W - dp[W] << endl;
    
    return 0;
}

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

int n, V, dp[50][20000];
int s[50];

int rec(int i, int v)
{
    if(dp[i][v] >= 0) return dp[i][v]; 
    int res;
    if(i == n) res = v;
    else if(s[i] > v) res = rec(i + 1, v);
    else res = min(rec(i + 1, v - s[i]), rec(i + 1, v));

    return dp[i][v] = res;
}

int main()
{
    cin >> V >> n;
    memset(dp, -1, sizeof(dp));
    for(int i = 0; i < n; i++) cin >> s[i];
    
    printf("%d\n", rec(0, V));

    return 0;
}