Submission

Score: 0

User: Shangbin

Problemset: อัศวินขี่ม้าขาว

Language: cpp

Time: 0.002 second

Submitted On: 2026-01-10 18:32:32

//Problem = https://grader.gchan.moe/problemset/c2_knb64_laracroft
#include <bits/stdc++.h>
using namespace std;

const int maxn = 505, maxW = 2005, inf = 1e9;
int n, wlimit, g[maxn], w[maxn], dpv[maxn][maxW], dpw[maxn][maxW];

int main(){
    cin >> n >> wlimit;
    for (int i = 1; i <= n; i++) cin >> g[i];
    for (int i = 1; i <= n; i++) cin >> w[i];
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= wlimit; j++){
            dpv[i][j] = max(dpv[i][j], dpv[i - 1][j]);
            if (j >= w[i]) 
                dpv[i][j] = max(dpv[i][j], dpv[i - 1][j - w[i]] + g[i]);
        }
    }
    int ans1 = dpv[n][wlimit];
    for (int j = 1; j <= ans1; j++) dpw[0][j] = inf;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= ans1; j++){
            dpw[i][j] = dpw[i - 1][j];
            if (j >= g[i]) 
                dpw[i][j] = min(dpw[i][j], dpw[i - 1][j - g[i]] + w[i]);
        }
    }
    int ans2 = dpw[n][ans1];
    cout << ans1 << ' ' << ans2;
}