hi,
i have a group of items, stored in an array, sorted according to the influence:
say
class person
name (string)
influence (number)
end class
i have a number x, i need to get a group of items where the sum of their influence is the closest to the given number x
example:
s1 70
s2 60
s3 25
s4 11
and x = 90:
so the result wil be s2 and s3 coz 70 + 25 = 95 is the closest sum to 90..
sorry for i dont know if such an algo has a name..
thanks for any help.
