DP recursive

simple dp ...
if money left becomes negative then return special value represented as no solution
if garment equals to required garment then return given money - money left
always taken the max value and increment the total garment number and u are done :)