原文:
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?
输入:
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.
样例输入:
3 7 1 2 2 3 4 5
样例输出:
5
译文:
硬币
描述:
现在有N枚不同的硬币,每一枚的都有它的面值V和重量W。Tony想外出旅行,不幸的是,他只能带总重量不超过K的硬币,那么他带哪些硬币能使得硬币的总面值最大?
输入:
第一行包含两个正整数N(N <= 100)和K(K <= 1000).
接下来N行,每一行包含两个正整数V和W,用来表示每一枚硬币的面值和重量.
输出:
一个正整数表示Tony能带硬币的总最大面值.
样例输入:
3 7 1 2 2 3 4 5
样例输出:
5