Submission

Score: 0

User: dddrrrr

Problemset: laracroft

Language: cpp

Time: 1.084 second

Submitted On: 2026-03-12 19:01:50

#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 <int> dp(target+1);
	dp[0] = 0;
	
	for(int i=0 ;i<n ;i++){
		for(int j=target ;j>=w[i] ;j--){
			dp[j] = max(dp[j] ,dp[j - w[i]] + v[i]);
		}
	}
	
	int mxval = dp[target] ;
	vector <int> dp1(mxval+1 ,INT_MAX);
	dp1[0] = 0;
	
	for(int i=0 ;i<n ;i++){
		for(int j=mxval ;j>=v[i] ;j--){
			dp1[j] = min(dp1[j] ,dp1[j - v[i]] + w[i]);
		}
	}
	
//	for(auto i : dp1)cout << i << ' ';
//	cout << '\n';
	
	cout << mxval << ' ' << dp1[mxval];
}