better McDoonalds meals than MinMax?

Hi,

assume you have a list of products + price like:
bigmc 3.59
koke  1.29
friez 0.79
....

and some meals like:
bigmc + koke + friez = 3.95


I want to make a program that lets you select the pruducts and then 
get the cheapest combination, even if it has some extra stuff for you.

I'd start by making a list of the products individually, then try to 
swap them with a menu and use a MinMax algorithm to go deeper into 
mixing.

Is there any better idea to reach this?


-- 
-Gernot
int main(int argc, char** argv) {printf 
("%silto%c%cf%cgl%ssic%ccom%c", "ma", 58, 'g', 64, "ba", 46, 10);}