Submission

Score: 100

User: sulinx

Problemset: laracroft

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-10 09:23:08

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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n,w,tmp;
    cin >> n >> w;
    vector<int> price(n),weight(n);
    for(int i = 0;i<n;i++) cin >> price[i];
    for(int i = 0;i<n;i++) cin >> weight[i];

    vector<int> dp(w+1,0);

    for(int i = 0;i<n;i++){
        for(int j = w;j >= weight[i];j--){
            dp[j] = max(dp[j],dp[j-weight[i]] + price[i]);
        }
    }

    int maxP = *max_element(dp.begin(),dp.end());
    int minW = 0;
    for(int j = 0;j<=w;j++){
        if(dp[j] == maxP){
            minW = j;
            break;
        }
    }
    cout << maxP << ' ' << minW;
}