For each fruit, if the total count is odd, return -1.

For each fruit, compute the excess in basket1 and basket2 (half the difference for each direction).

Collect all excess fruits to be swapped from both baskets.

Sort the lists and pair the smallest with the largest, but always consider swapping via the global minimum fruit if it's cheaper.

Sum the minimum cost for each swap.

Code

[{"language":"C++","code":"#include <unordered_map>\nclass Solution {\npublic:\n    long long minCost(vector<int>& b1, vector<int>& b2) {\n        unordered_map<int, int> cnt;\n        for (int x : b1) cnt[x]++;\n        for (int x : b2) cnt[x]--;\n        vector<int> pos, neg;\n        int mn = INT_MAX;\n        for (auto& [k, v] : cnt) {\n            mn = min(mn, k);\n            if (v % 2 != 0) return -1;\n            if (v > 0) for (int i = 0; i < v/2; ++i) pos.push_back(k);\n            if (v < 0) for (int i = 0; i < -v/2; ++i) neg.push_back(k);\n        }\n        sort(pos.begin(), pos.end());\n        sort(neg.rbegin(), neg.rend());\n        long long ans = 0;\n        for (int i = 0; i < pos.size(); ++i) {\n            ans += min({pos[i], neg[i], 2*mn});\n        }\n        return ans;\n    }\n};","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">#include</span><span style=\"color:#032F62;--shiki-dark:#9ECBFF\"> &#x3C;unordered_map></span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public:</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    long</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> long</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> minCost</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">vector</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">></span><span style=\"color:#D73A49;--shiki-dark:#F97583\">&#x26;</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> b1</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\">vector</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">></span><span style=\"color:#D73A49;--shiki-dark:#F97583\">&#x26;</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> b2</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">        unordered_map</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">&#x3C;int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int></span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> cnt;</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">        for</span><span style=\"color:#24292E;--shiki-dark:#E1E4E

Related Tags