Submission

Score: 100

User: KantaponZ

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-01-21 10:07:18

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

int N, W;
int v[505], w[505];
int dp[5005];

int ansV = 0, ansW = 0;

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin >> N >> W;
    for (int i = 1; i <= N; i++) {
        cin >> v[i];
        
    }
    for (int i = 1; i <= N; i++) {
        cin >> w[i];
    }
    for (int i = 1; i <= W; i++) dp[i] = -1e9;

    for (int i = 1; i <= N; i++) {
        for (int j = W; j >= w[i]; j--) {
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }

    for (int i = 1; i <= W; i++) {
        if (dp[i] > ansV) {
            ansV = dp[i]; ansW = i;
        }
    }

    cout << ansV << " " << ansW;
}