Submit: 1 Solved: 1

[Submit] [Status] [Web Board] [Creator:]

Farmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e., the number of coins he uses to pay plus the number of coins he receives in change is minimized. Help him to determine what this minimum number is.

FJ wants to buy *T* (1 ≤ *T* ≤ 10,000) cents of supplies. The currency system has *N* (1 ≤ *N* ≤ 100) different coins, with values *V*_{1}, *V*_{2}, ..., *V _{N}* (1 ≤

Line 1: Two space-separated integers: *N* and *T*.

Line 2: N space-separated integers, respectively *V*_{1}, *V*_{2}, ..., *V _{N}* coins (

Line 3: N space-separated integers, respectively

Line 1: A line containing a single integer, the minimum number of coins involved in a payment and change-making. If it is impossible for Farmer John to pay and receive exact change, output -1.

```
3 70
5 25 50
5 2 1
```

`3`

Farmer John pays 75 cents using a 50 cents and a 25 cents coin, and receives a 5 cents coin in change, for a total of 3 coins used in the transaction.