Submission

Score: 100

User: Neozaawwman1

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-04 23:48:14

#include <bits/stdc++.h>
using namespace std;
int N,T;
vector<int> W;
vector<int> V;
int dp[2005];
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin>>N>>T;
    for(int i=0; i<N; i++){
        int a;cin>>a;
        V.push_back(a);
    }
    for(int i=0; i<N; i++){
        int a;cin>>a;
        W.push_back(a);
    }
    for(int i=0; i<N; i++){
        for(int j=T; j>=W[i]; j--){
            dp[j]=max(dp[j],dp[j-W[i]]+V[i]);
        }
    }
    int maxValue = 0;
    for(int j = 0; j <= T; j++){
        maxValue = max(maxValue, dp[j]);
    }

    int minWeight = 0;
    for(int j = 0; j <= T; j++){
        if(dp[j] == maxValue){
            minWeight = j;
            break;
        }
    }

    cout << maxValue << " " << minWeight;
    return 0;
}