Introduction - If you have any usage issues, please Google them yourself
With n different coins, the face value of the coins stored in the array of T 〔1: n〕 in. Now use these coins to find the money. You can use the number of coins of various denominations stored in the array Coins 〔1: n〕 in.
The amount of money for any 0 ≤ m ≤ 20001, find the money to design a coin with at least m of the method.