寒假程序翻译2.11

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH18

Coins

 1000ms  65536K

描述：

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。托尼想要去旅行。不幸的是他只能带走不超过K质量的硬币。他 最多能带走价值多少的硬币呢？）

输入：

First line: two positive integers N (N <= 100) and 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和K

下一行：第i行有两个正整数V 和W 为其硬币的价值和重量）

输出：

One integer indicating the total value of coins at most.

（一个整数表示可带走硬币 的最大价值。）