Submission

Score: 100

User: SnowAveNode

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-04-19 11:02:59

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

const int nx = 1e5 + 5, MOD = 1e9 + 7, inf = 2e9; const ll INF = 4e18;

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

    ll n,m;cin>>n>>m;
    vector<ll>W(n),V(n);
    vector<ll>dp(m+1,0);
    for(auto &x:V)cin>>x;
    for(auto &x:W)cin>>x;

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

    int idx=0,val=0;
    for(int j=1;j<=m;j++){
        if(dp[j]>dp[j-1]){
            idx=j;
            val=dp[j];
        }
    }

    cout<<val<<' '<<idx<<'\n';

    return 0;
}