18:Coins
总时间限制:
1000ms
内存限制:
65536kB
描述
There are N kinds of coins. Each kind of coins has a value V and a weight W. Tony wants to go traveling. Unfortunately, he can only carry coins of which the total weight is not greater than K. How much total value of coins can he carry at most?
有N种硬币。每种硬币有价值V和重量W。Tony想要旅游。不幸的是,他不能带总重量超过K的硬币。问他最多能带总价值为多少的硬币。
输入
First line: two positive integers N (N <= 100) and K (K <= 1000).
第一行:两个正整数N(N<=100)和K(K<=1000)。
Next N lines: the i-th line two positive integers V and W (V,W <= 1000) indicating the value and the weight of the i-th coin.
下N行:第i行有两个正整数V和W(V,W<=1000)表示第I个硬币的价值和质量。
输出
One integer indicating the total value of coins at most.
一个整数表示硬币最大的总价值。
样例输入
3 7 1 2 2 3 4 5
样例输出
5