Submission

Score: 100

User: august

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-15 20:04:22

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n,W;
    cin>> n>> W;

    vector<int> v(n), w(n);
    for (int i=0; i<n; i++) cin>> v[i];
    for (int i=0; i<n; i++) cin>> w[i];

    vector<int> dp(W+1, 0);
    for (int i=0; i<n; i++) {
        for (int j=W; j>=w[i]; j--) {
            dp[j] = max(dp[j], dp[j-w[i]]+v[i]);
        }
    }
    int mx = 0, ans=0;
    for (int i=0; i<=W; i++) {
        if (mx < dp[i]) {
            mx = dp[i];
            ans = i;
        }
    }
    cout<< mx<< ' '<< ans;
}