Submission

Score: 100

User: iij

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-29 17:21:38

#include <bits/stdc++.h>

using namespace std;
#define int long long
signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, m;
    cin >> n >> m;

    int v[n], w[n];
    for (auto &x : v) cin >> x;
    for (auto &x : w) cin >> x;

    int dp[m+1];
    fill(dp, dp+m+1, 0);
    for (int i = 0; i < n; i++) {
        for (int j = m; j >= w[i]; j--) {
            dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
        }
    }
    

    int aw = 0, av = dp[0];
    for (int i = m; i >= 0; i--) {
        if (av > dp[i]) break;
        av = dp[i];
        aw = i;
    }

    cout << av << " " << aw;
}