完全背包

https://nanti.jisuanke.com/t/41401

Dawn-K recently discovered a very magical phenomenon in the supermarket of Northeastern University: The large package is not necessarily more expensive than the small package.

On this day, Dawn-K came to the supermarket to buy mineral water, he found that there are nnn types of mineral water, and he already knew the price ppp and the weight ccc (kg) of each type of mineral water. Now Dawn-K wants to know the least money aaa he needs to buy no less than mmm kilograms of mineral water and the actual weight bbb of mineral water he will get. Please help him to calculate them.

Input

The input consists of multiple test cases, each test case starts with a number nnn (1≤n≤1031 \le n \le 10^31≤n≤103) -- the number of types, and mmm (1≤m≤1041 \le m \le 10^41≤m≤104) -- the least kilograms of water he needs to buy. For each set of test cases, the sum of nnn does not exceed 5e45e45e4.

Then followed n lines with each line two integers ppp (1≤p≤1091 \le p \le 10^91≤p≤109) -- the price of this type, and ccc (1≤c≤1041 \le c \le 10^41≤c≤104) -- the weight of water this type contains.

Output

For each test case, you should output one line contains the minimum cost aaa and the weight of water Dawn-K will get bbb. If this minimum cost corresponds different solution, output the maximum weight he can get.

(The answer aaa is between 111 and 10910^9109, and the answer bbb is between 111 and 10410^4104)

样例输入

3 3
2 1
3 1
1 1
3 5
2 3
1 2
3 3

样例输出

3 3
3 6
https://blog.csdn.net/qq_38984851/article/details/81133840

//#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include <string>
#include 
#include 
#include 
#include 
#include