Submission

Score: 100

User: dddrrrr

Problemset: laracroft

Language: cpp

Time: 0.004 second

Submitted On: 2026-03-12 19:20:42

#include <bits/stdc++.h>
#define int long long
const int MOD = 1e7 + 9;
using namespace std;


int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int n ,target;
	cin >> n >> target;
	vector <int> v(n) ,w(n);
	for(auto &it : v)cin >> it;
	for(auto &it : w)cin >> it;
	
	
	vector <pair <int ,int>> dp(target+1);
	dp[0].first = 0;
	dp[0].second = 0;
	
	int weight = 0;
	
	for(int i=0 ;i<n ;i++){
		for(int j=target ;j>=w[i] ;j--){
			if(dp[j].first < dp[j - w[i]].first + v[i]){
				dp[j].first = dp[j - w[i]].first + v[i];
				dp[j].second = dp[j - w[i]].second + w[i];
			}
			else if(dp[j].first == dp[j - w[i]].first + v[i]){
				dp[j].second = min(dp[j - w[i]].second+w[i] ,dp[j].second);
			}
		}
	}
	
	cout << dp[target].first << ' ' << dp[target].second ;
	
}