From a545e9bbd0c4ee3abc801e388740f74a586c7f9e Mon Sep 17 00:00:00 2001
From: chayan das <dasshuvo817@gmail.com>
Date: Sat, 2 Aug 2025 20:41:38 +0530
Subject: [PATCH] Create 2561. Rearranging Fruits

---
 2561. Rearranging Fruits | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 2561. Rearranging Fruits

diff --git a/2561. Rearranging Fruits b/2561. Rearranging Fruits
new file mode 100644
index 0000000..635099b
--- /dev/null
+++ b/2561. Rearranging Fruits	
@@ -0,0 +1,25 @@
+
+
+class Solution {
+public:
+    long long minCost(vector<int>& A, vector<int>& B) {
+        unordered_map<int, int> freq;
+        for (int x : A) freq[x]++;
+        for (int x : B) freq[x]--;
+
+        vector<int> extra;
+        int minVal = INT_MAX;
+        for (auto& [k, v] : freq) {
+            if (v % 2) return -1;
+            for (int i = 0; i < abs(v) / 2; ++i)
+                extra.push_back(k);
+            minVal = min(minVal, k);
+        }
+
+        sort(extra.begin(), extra.end());
+        long long cost = 0;
+        for (int i = 0; i < extra.size() / 2; ++i)
+            cost += min(extra[i], 2 * minVal);
+        return cost;
+    }
+};