Submission

Score: 100

User: foldnut

Problemset: laracroft

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-18 21:10:22

#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n, m, ans, p, a[N], w[N], dp[N][N];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    for(int i = 1;i<=n;i++) cin >> a[i];
    for(int i = 1;i<=n;i++) cin >> w[i];
    for(int i = 1;i<=n;i++){
        for(int j = 0;j<=m;j++){
            dp[i][j] = max(dp[i - 1][j], (j >= w[i] ? dp[i - 1][j - w[i]] + a[i] : 0));
        }
    }
    for(int i = 0;i<=m;i++){
        if(dp[n][i] > ans){
            ans = dp[n][i];
            p = i;
        }
    }
    cout << ans << ' ' << p;
}