Submission

Score: 100

User: ki

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-20 12:45:27

#include<iostream>
#include<vector>
using namespace std;
int n,W;
int main(){
	cin>>n>>W;
	vector<int>g(n),w(n);
	for(auto&e:g)cin>>e;
	for(auto&e:w)cin>>e;
	vector<int> dp(W+5);
	for(int i=0;i<n;i++){
		for(int j=W;j>=w[i];j--){
			dp[j]=max(dp[j],dp[j-w[i]]+g[i]);
		}
	}
	int mx=0;
	for(auto&e:dp)mx=max(mx,e);
	for(int i=0;i<=W;i++){
		if(dp[i]==mx)cout<<mx<<' '<<i<<'\n',exit(0);
	}
}