Submission

Score: 100

User: Iamheretodoproblems

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-23 23:22:57

#include <bits/stdc++.h>
using namespace std;

int main() 
{
  int n,w;
  cin>>n>>w;
  vector<int> value,weight;
  int x;
  for(int k=0;k<n;k++)
  {
    cin>>x;
    value.push_back(x);
  }
  for(int k=0;k<n;k++)
  {
    cin>>x;
    weight.push_back(x);
  }
  vector<int> dp(w+1,0);
  for(int k=0;k<n;k++)
  {
    for(int i=w;i>=weight[k];i--)
    {
      dp[i]=max(dp[i],dp[i-weight[k]]+value[k]);
    }
  }
  cout<<dp[w];
  for(int k=w-1;k>=0;k--)
  {
    if(dp[k]!=dp[w])
    {
      cout<<" "<<k+1;
      return 0;
    }
  }
  cout<<" 0";
}