Problem:
Score : 100 points

Problem Statement

There are N items, numbered 1, 2, \ldots, N.
For each i (1 \leq i \leq N), Item i has a weight of w_i and a value of v_i.

Taro has decided to choose some of the N items and carry them home in a knapsack.
The capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.

Find the maximum possible sum of the values of items that Taro takes home.

Constraints

All values in input are integers.

1 \leq N \leq 100

1 \leq W \leq 10^9

1 \leq w_i \leq W

1 \leq v_i \leq 10^3

Input

Input is given from Standard Input in the following format:

N W
w_1 v_1
w_2 v_2
:
w_N v_N

Output

Print the maximum possible sum of the values of items that Taro takes home.

Sample Input 1

3 8
3 30
4 50
5 60

Sample Output 1

90

Items 1 and 3 should be taken.
Then, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.

Sample Input 2

1 1000000000
1000000000 10

Sample Output 2

10

Sample Input 3

6 15
6 5
5 6
6 4
6 6
3 5
7 2

Sample Output 3

17

Items 2, 4 and 5 should be taken.
Then, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>

using namespace std;

int wt[100001], v[100001];
long long dp[101][100001];

const int INF = 1e9 + 7;

int solve(int V, int n)
{
	if (V == 0)
		return 0;
	if (n == 0)
		return INF;
	if (dp[n][V] != -1)
		return dp[n][V];
	if (V < v[n - 1])
		return dp[n][V] = solve(V, n - 1);
	else
		return dp[n][V] = min(wt[n - 1] + solve(V - v[n - 1], n - 1), solve(V, n - 1));
}

int main()
{
	int n, V, W;
	cin >> n >> W;
	for (int i = 0; i < n; i++)
		cin >> wt[i] >> v[i];
	V = 0;
	for (int i = 0; i < n; i++)
		V += v[i];
	memset(dp, -1, sizeof(dp));
	int ans = 0;
	for (int i = V; i >= 0; i--)
	{
		if (solve(i, n) <= W)
		{
			ans = i;
			break;
		}
	}
	cout << ans << endl;
	return 0;
}