Problem:
Knapsack Problem

You have N kinds of items that you want to put them into a knapsack. Item i has value vi and weight wi.

You want to find a subset of items to put such that:

The total value of the items is as large as possible.

The items have combined weight at most W, that is capacity of the knapsack.

You can select as many items as possible into a knapsack for each kind.

Find the maximum total value of items in the knapsack.

Input

N W
v1 w1
v2 w2
:
vN wN

The first line consists of the integers N and W. In the following lines, the value and weight of the i-th item are given.

Output

Print the maximum total values of the items in a line.

Constraints

1 ≤ N ≤ 100

1 ≤ vi ≤ 1000

1 ≤ wi ≤ 1000

1 ≤ W ≤ 10000

Sample Input 1

4 8
4 2
5 2
2 1
8 3

Sample Output 1

21

Sample Input 2

2 20
5 9
4 10

Sample Output 2

10

Sample Input 3

3 9
2 1
3 1
5 2

Sample Output 3

27

Solution in C# (judge verdict: Accepted)

using System;
using System.Linq;//リストの使用
using System.Collections.Generic;
class Program
{
	static void Main()
	{
		string[] input = Console.ReadLine().Split(' ');
		long n = long.Parse(input[0]);
		long w = long.Parse(input[1]);
    long[,] dp = new long[n+1,w+1];//dp[見た種類、重さの和]=価値の和

    long[,] vertexes = new long[n,2];//ここに受け取る
    for(long i = 0; i < n; i++)
    {
      long[] nums = Array.ConvertAll(Console.ReadLine().Split(' '),long.Parse);//１行ごとに受け取る
      vertexes[i,0] = nums[0];
      vertexes[i,1] = nums[1];
    }

    for(long i = 1; i <= n; i++)
    {
      for(long j = 0; j <= w; j++)
      {
        if(j-vertexes[i-1,1] >= 0)
        {
          dp[i,j] = Math.Max(dp[i,j], dp[i,j-vertexes[i-1,1]] + vertexes[i-1,0]);
          dp[i,j] = Math.Max(dp[i,j], dp[i-1,j-vertexes[i-1,1]] + vertexes[i-1,0]);
        }
        dp[i,j] = Math.Max(dp[i,j], dp[i-1,j]);
      }
    }

    for(long i = 0; i <= n; i++)
    {
      for(long j = 0; j <= w; j++)
      {
        //Console.WriteLine(i+" "+j+" "+dp[i,j]);
      }
    }

		Console.WriteLine(dp[n,w]);
	}
}