Submission

Score: 100

User: Hxluk.ka

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2025-12-28 12:22:05

#include <iostream>
using namespace std;
const int nx=503, wx=2e3+3;
int dp[wx], v[nx], w[nx], n, W, resv, resw;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    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=W; j>=w[i]; j--) dp[j]=max(dp[j], v[i]+dp[j-w[i]]);
    for (int i=0; i<=W; i++) if (dp[i]>resv) resv=dp[i], resw=i;

    return cout<<resv<<' '<<resw, 0;
}