英语题目翻译

题目地址：

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

Coins

硬币

描述：

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（N <= 100）和 K（K <= 1000）。

接下来的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