o(n3) solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minimumAddedInteger(vector<int>& nums1, vector<int>& nums2) {\n        sort(nums1.begin(),nums1.end());\n        sort(nums2.begin(),nums2.end());\n        int n = nums1.size();\n        int m = nums2.size();\n        int ans = INT_MAX;\n        for(int i=0;i<n;i++){\n            for(int j=i+1;j<n;j++){\n                vector<int>v;\n                for(int k=0;k<n;k++){\n                    if(k!=i && k!=j){\n                        v.push_back(nums1[k]);\n                    }\n                }\n                int a1 = nums2[0]-v[0];\n                bool a = true;\n                for(int i=1;i<m;i++){\n                    int ele = nums2[i]-v[i];\n                    if(ele != a1){\n                         a = false;\n                         break;\n                    } \n                }\n                if(a == true){\n                    ans = min(ans,a1);\n                }\n            }\n        }\n        return ans;\n    }\n};\n```
['Array', 'Sorting', 'C++']