Submission

Score: 100

User: Gump2011

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-08 17:28:20

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n,W;
    cin>>n>>W;

    vector<long long> g(n+1);
    vector<int> w(n+1);

    for(int i=1;i<=n;i++) cin>>g[i];
    for(int i=1;i<=n;i++) cin>>w[i];

    vector<long long> dp(W+1,0);

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

    long long best=0;
    int weight=0;

    for(int j=0;j<=W;j++){
        if(dp[j]>best){
            best=dp[j];
            weight=j;
        }
    }

    cout<<best<<" "<<weight;
}