Submission

Score: 100

User: Nay-O

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-18 12:39:45

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

ll dp[2005];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    
    int n,m; cin >> n>>m;
    int v[n+1],w[n+1];
    
    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 = m; j >=w[i]; j--){
            dp[j] = max(dp[j-w[i]]+v[i],dp[j]);
        }
    }
    
    int a = m;
    while(a>0&&dp[a]==dp[a-1]) a--;
    
    cout << dp[a]<<" "<<a;
    
    return 0;
}