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