描述
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。
接下来的N行:第i行有两个数V和W,分别代表硬币的数值和重量。
输出:
硬币的最大数值。