Submission

Score: 100

User: letdown

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-22 23:19:15

#include <bits/stdc++.h>

using namespace std;
#define int long long
signed main() {
    int n, m;
    cin >> n >> m;
    vector<int> v(n+1), w(n+1);
    for (int i = 1; i <= n; i++) cin >> v[i];
    for (int i = 1; i <= n; i++) cin >> w[i];

    vector<int> dp(m+1, 0);
    for (int i = 1; i <= n; i++) {
        for (int j = m; j >= w[i]; j--) {
            dp[j] = max(dp[j], dp[j-w[i]]+v[i]);
        }
    }
    
    int av = 0, aw = 0;
    for (int i = 0; i <= m; i++) {
        if (dp[i] > av) {
            av = dp[i];
            aw = i;
        }
    }
    cout << av << " " << aw;
}