[Python3]Easy Binary search
Generate all comb, and do binary search\n\nclass Solution:\n    def closestCost(self, baseCosts: List[int], toppingCosts: List[int], target: int) -> int:\n     
Generate all comb, and do binary search\n```\nclass Solution:\n    def closestCost(self, baseCosts: List[int], toppingCosts: List[int], target: int) -> int:\n        s = set([0])\n        for t in toppingCosts:\n            for ss in list(s):\n                s.add(ss+t); s.add(ss+2*t)\n        news = set()\n        for b in baseCosts:\n            for ss in s: news.add(ss+b)\n        s = sorted(list(news))\n        i = bisect.bisect(s, target)\n        if i == len(s): return s[-1]\n        if i == 0:return s[0]\n        if abs(s[i] - target) > abs(s[i-1] - target): return s[i-1]\n        elif abs(s[i] - target) < abs(s[i-1] - target): return s[i]\n        else: return s[i-1]\n        \n```
[]