Coins（NOIOPJENGLISH18）

Coins

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

 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?

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

接下来n行：第i行两个正整数表示v和w分别表示第i个硬币的价值和质量

输出：

One integer indicating the total value of coins at most.

一个整数表示带走硬币的总价值

样例输入：

3 7
1 2
2 3
4 5

样例输出：

5