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: Wrong Answer)

//実験２：総和からの消し込み
//重くて価値が低い順にソート
//重さが基準以下となるまで、価値が低い順に引いていく
function Main(input){
  //パラメータ受け取り
  input = input.split("\n");
  inputStr = input[0].split(" ");
  var N = Number.parseInt(inputStr[0]);
  var W = Number.parseInt(inputStr[1]);
  var obj = [];
  var t_w = 0;
  var t_v = 0;
  for(var i=0 ; i<N ; i++){
    inputStr = input[i+1].split(" ");
    obj.push(inputStr.map( inputStr => parseInt(inputStr)))
    //総重量と総価値を記録
    t_w += obj[obj.length-1][0];
    t_v += obj[obj.length-1][1];
  }
  //console.log("総重量",t_w);
  //console.log("総価値",t_v);
  
  //ソート(価値を昇順[1]、重さを降順[0]でソート)
  obj.sort(function(a, b){
    	//重さを降順
		if (a[0] > b[0]) return -1;
		if (a[0] < b[0]) return 1;
		//価値は昇順
		if (a[1] > b[1]) return 1;
		if (a[1] < b[1]) return -1;
		return 0;
  });
  //重量(t_w)がW以下になるまで、価値(t_v)から消しこむ
  var i=0;
  while(t_w>W){
    t_w -= obj[i][0];
    t_v -= obj[i][1];
    i++;
  }
  //console.log("消し込み後重量",t_w);
  //console.log("その時の価値",t_v);
  console.log(t_v);
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));