Submission

Score: 100

User: skibididopdop

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-15 14:42:28

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



int main(){
    int n,w;
    cin>>n>>w;
    vector <int> v(n);
    vector <int> we(n);
    for (int i=0;i<n;i++){
        cin>>v[i];
    }
    for (int i=0;i<n;i++){
        cin>>we[i];
    }
    vector <int> dp(w+1,0);
    dp[0]=0;
    for (int i=0;i<n;i++){
        for (int j=w;j>=0;j--){
            if (j-we[i]>=0){
                dp[j]=max(dp[j-we[i]]+v[i],dp[j]);
            }
        }
    }
    int mx=0;
    int mn=0;
    for (int i=0;i<=w;i++){
        if (dp[i]>mx){
            mx=dp[i];
            mn=i;
        }
    }
    cout<<mx<<" "<<mn;
}