Coins（http://noi.openjudge.cn/english/18/）

原文：

描述

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和k

之和的每一行分别是一枚硬币的v和w

输出：

一个整数，表示最多的价值