Submission

Score: 100

User: House123

Problemset: laracroft

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-04 14:35:00

#include <bits/stdc++.h>
using namespace std;
const int nx = 502, wx = 2002;
int v[nx],w[nx];
int N,W;
int dp[nx][wx];
int main(){
    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 <= N; i++){
        for(int j = 1; j <= W;j++){
            dp[i][j] = dp[i-1][j];
            if(j - w[i] >= 0){
                dp[i][j] = max(dp[i-1][j], dp[i-1][j - w[i]] + v[i]);
            }
        }
    }
    if(dp[N][W] == 0){
        cout << "0 0";
        return 0;
    }
    
    int weight;
    int i = N;
    for(int j = W; j >= 0; j--){
        
        if(dp[i][j] == dp[N][W]){
            weight = j;
        }
    }

    cout << dp[N][W] << ' ' << weight;
    
}