Submission

Score: 100

User: C12

Problemset: laracroft

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-06 23:56:10

#include <bits/stdc++.h>

using namespace std;

#define ll long long

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);

    int n,k;
    cin >> n >> k;

    int cost[501],wei[501];

    for(int i = 0;i < n;i++) cin >> cost[i];
    for(int i = 0;i < n;i++) cin >> wei[i];

    int dp[2001];
    for(int i = 0;i <= k;i++)dp[i] = 0;

    for(int i = 0;i < n;i++){
        for(int j = k;j >= 0;j--){
            if(j < wei[i]) continue;
            dp[j] = max(dp[j],dp[j-wei[i]] + cost[i]);
        }
    }
    int i;
    for(i = k;i > 0;i--){
        if(dp[i] != dp[i-1]) break;
    }

    // for(int i = 0;i <= k;i++){
    //     cout<< dp[i] << '\n';
    // }
    
    if(dp[i] == INT_MIN/2) dp[i] = 0;

    cout << dp[i] << ' ' << i;

    return 0;
}