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^5

1 \leq w_i \leq W

1 \leq v_i \leq 10^9

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

5 5
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000

Sample Output 2

5000000000

The answer may not fit into a 32-bit integer type.

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 JavaScript (node.js v5.12) (judge verdict: Accepted)

//実験３：アドバイスに基づいて再帰で組む
//グローバル変数の定義
var N = 0;
var W = 0;
var obj = [];
var dp = [];
//再帰処理
function RecursiveDp(i,j){

  //メモによる再処理防止
  if (dp[i][j] != 0) {        
    return dp[i][j];
  }

  var res = 0;
  if (i === N) { 
    //商品がもうないので0を代入する        
    res = 0;
  } else if (j < obj[i][0]) { 
    //容量不足なので入れない処理だけをする
    res = RecursiveDp(i+1, j);
  } else { 
    //入れると最大になるとは限らないので入れる時と入れない時の大きい方を取る
    res = Math.max(RecursiveDp(i+1, j), RecursiveDp(i+1,j-obj[i][0])+obj[i][1]);
  }
  dp[i][j] = res;
  return res;
}
function Main(input){
  //パラメータ受け取り
  input = input.split("\n");
  inputStr = input[0].split(" ");
  N = Number.parseInt(inputStr[0]);
  W = Number.parseInt(inputStr[1]);
  //要素の溜め込み
  for(var i=0 ; i<N ; i++){
    inputStr = input[i+1].split(" ");
    obj.push(inputStr.map( inputStr => parseInt(inputStr)))
  }
  //DP用メモの作成
  for(var i=0 ; i<=N ; i++){
    dp.push(Array(W+1).fill(0));
  }
  //再帰しつつ結果を出力
  console.log(RecursiveDp(0,W));
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));