Recursive function to find maximum number formed such that the sum of cost of digits of formed number is K
string recursion ( int arr [ ] , int idx , int N , int K , vector < vector < string > > & dp ) {