Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have the following selection problem:
Given a population of N items, each item having a +ve cost(C_i) and given a user input k and total cost S. Find the optimal k items from the population of N items such that abs(S-sum(C_i)) is minimum.
Will appreciate any help on this
Do you have a bound on N or S? If N is small, you can try all subsets. If S is small you can solve it with knapsack (look for min sum(C_i)>=S and max sum(C_i)<=S)