Submission

Score: 100

User: Phat12

Problemset: laracroft

Language: cpp

Time: 0.005 second

Submitted On: 2025-11-04 20:20:34

/*
TASK: c2_knb64_laracroft.cpp
LANG: C++
AUTHOR: Phat
*/
#include <bits/stdc++.h>
#define FO(i,L,R) for (int i = L; i < R; i++)
using namespace std;
int dp[501][2001];
int val[501];
int weig[501];
int32_t main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,w;
    cin >> n >> w;
    for (int i=1;i<=n;i++){
        cin >> val[i];
    }
    for (int i=1;i<=n;i++){
        cin >> weig[i];
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=w;j++){
            if (j >= weig[i]) dp[i][j] = max(dp[i-1][j],dp[i-1][j-weig[i]]+val[i]);
            else dp[i][j] = dp[i-1][j];
        }
    }
    cout << dp[n][w] << ' ' << lower_bound(dp[n],dp[n]+w+1,dp[n][w])-dp[n];
    return 0;
}