Submission

Score: 100

User: Zonezonee

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2025-12-23 18:26:51

#include <bits/stdc++.h>
using namespace std;
const int N = 5e2+10, S = 2e3+10;

int dp[S], v[N], w[N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, s;
    cin >> n >> s;
    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 = s; j >= w[i]; --j){
            dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
        }
    }
    int v_ans = 0, w_ans = 0;
    for(int i = 0; i <= s; ++i){
        if(dp[i] > v_ans){
            v_ans = dp[i];
            w_ans = i;
        }
    }
    cout << v_ans << ' ' << w_ans << '\n';
}