2.10我的第十八篇

题目链接：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?

输入：

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.

输出：

One integer indicating the total value of coins at most.

我的翻译：有n个硬币，每个硬币的价值为v，重量为w。现在有一个人能拿总重量不能超过k的硬币，请你求出他能拿硬币的最大价值。

输入：第一行两个数，第一个数为硬币的个数n，第二个数为所能拿的最大重量。接下来n行，每行有两个数， 第一个数为硬币的价值，第二个数为硬币的重量。

输出：最大能拿硬币的价值。