Submission

Score: 100

User: SnowAveNode

Problemset: laracroft

Language: python

Time: 0.351 second

Submitted On: 2026-04-19 11:18:37

import sys
input = sys.stdin.readline

n,m=map(int,input().split())
V=list(map(int,input().split()))
W=list(map(int,input().split()))
dp=[0]*(m+1)

for i in range(1,n+1):
    for j in range(m,W[i-1]-1,-1):
        dp[j]=max(dp[j],dp[j-W[i-1]]+V[i-1])

idx,val=0,0
for j in range(1,m+1):
    if dp[j]>dp[j-1]:
        idx=j
        val=dp[j]

print(val,idx)