[AtCoder][DP][Educational DP Contest][競プロ]E-Knapsack 2

import numpy as np
n, W = map(int, input().split())
inf = pow(10, 10)
V = 10**3
dp = np.full((n+1, n*V+1), inf)
dp[0, 0] = 0

for i in range(n):
    w, v = map(int, input().split())
    np.minimum(dp[i, v:], dp[i, :-v]+w, out = dp[i+1, v:])
    dp[i+1, :v] = dp[i, :v]

print(max(np.where(dp[n] <= W)[0]))