Submission

Score: 100

User: Penelope

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-07 22:09:25

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

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

    int n,m;

    cin>>n>>m;

    vector<int> val(n);
    vector<int> we(n);

    for(int i =0;i<n;i++){
        cin>>val[i];
    }
    for(int i =0;i<n;i++){
        cin>>we[i];
    }

    vector<int> dp(m+1,-1e9+7);
    dp[0]=0;
    
    int mx_sum=0;
    int min_index=1e9+7;

    for(int i =0;i<n;i++){
        for(int j =m;j>0;j--){
            if(j-we[i]>=0)
                dp[j]=max(dp[j],dp[j-we[i]]+val[i]);
                if(dp[j]>=mx_sum){
                    mx_sum=dp[j];
                }
        }
    }
    
    for(int i =0;i<=m;i++){
        if(dp[i]==mx_sum){
            cout<<mx_sum<<" "<<i;
            return 0;
        }
        
    }

    
    
}