Submission

[PPPPPPPPPPPPPPP]

Score: 100

User: hmmm

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2025-04-06 10:41:03

#include<bits/stdc++.h>
using namespace std;
const int N=505;
int a[N],b[N];
long long int dp[4*N];

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++) cin >> b[i];
    for(int i=1;i<=n;i++){
        for(int j=m;j>=b[i];j--){
            dp[j]=max(dp[j],dp[j-b[i]]+a[i]);
        }
    }
    long long int ans=0,id=0;
    for(int i=0;i<4*N;i++){
        if(ans<dp[i]){
            ans=dp[i];
            id=i;
        }
    }
    cout << ans << ' ' << id;
}