u think first sort the array ................then find the sum of +ve no and check with sum K if it is less then continue....else if equal then break and if more start subtracting from negative no present in array................in all the process record the elements whom u are adding or subtracting..........i think u will get the subset of array.................
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
