Given an array of denominations and array Count , find minimum number of coins required to form sum S.

for example:

```
coins[]={1,2,3};
count[]={1,1,3};
```

i.e we have 1 coin of Rs 1 , 1 coin of Rs 2 , 3 coins of Rs 3.

Now if we input S = 6 then output should be 2 with possible combination : 3+3 = 6