Count Zeros
We sum numbers of each array, considering zeros as 1.\n\t- This is the minimum sum we can get.\n2. If sum of one array is smaller, we can make it equal if that 
1. We sum numbers of each array, considering zeros as `1`.\n\t- This is the minimum sum we can get.\n2. If sum of one array is smaller, we can make it equal if that array has at least one zero.\n3. If it does not, we cannot make arrays equal.\n4. Otherwise, we return the larger of two sums.\n\n**C++**\n```cpp\nlong long minSum(vector<int>& n1, vector<int>& n2) {\n    long long z1 = count(begin(n1), end(n1), 0), z2 = count(begin(n2), end(n2), 0);\n    long long s1 = accumulate(begin(n1), end(n1), z1);\n    long long s2 = accumulate(begin(n2), end(n2), z2);\n    if ((s1 < s2 && !z1) || (s2 < s1 && !z2))\n        return -1;\n    return max(s1, s2);\n}\n```
['C']