1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

#include <iostream>
#include <vector>
#include <cmath>

class Solution {
public:
    int closestCost(std::vector<int>& baseCosts, std::vector<int>& toppingCosts, int target) {
        int m = std::max(target * 2, baseCosts[0] + 1);
        std::vector<int> dp(m);
        
        for (int c : baseCosts) {
            if (c < m) {
                dp[c] = 1;
            }
        }
        
        for (int c : toppingCosts) {
            for (int i = m - 1; i >= c; --i) {
                dp[i] |= dp[i - c];
            }
            for (int i = m - 1; i >= c; --i) {
                dp[i] |= dp[i - c];
            }
        }
        
        int min_val = 0x7fff'ffff, price;
        for (int i = 0; i < m; ++i) {
            if (dp[i] && min_val > std::abs(i - target)) {
                min_val = std::abs(i - target);
                price = i;
            }
        }
        
        return price;
    }
};