Submission

Score: 100

User: mydKN

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-10 16:02:13

#include <bits/stdc++.h>

using namespace std;

const int maxn = 510;
const int maxw = 2010;

int n, mxw;
int v[maxn], w[maxn];
int dp[maxw];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin >> n >> mxw;
	for(int i=0;i<n;++i) cin >> v[i];
	for(int i=0;i<n;++i) cin >> w[i];
	for(int i=0;i<n;++i){
		for(int j=mxw;j>=w[i];--j){
			dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
		}
	}
	cout << dp[mxw] << " " << lower_bound(dp, dp+mxw+1, dp[mxw])-dp;
}