easy solution
Intuition\ne.g\nn1 = 4 8 12 16 20\nn2 = 10 14 18\n\nwe need to remove 2 elements,\nthe common min in n1 must be in n1[0] n1[1] n1[2]\nwant n1-n2[0] smaller, n1 
# Intuition\ne.g\nn1 = 4 8 12 16 20\nn2 = 10 14 18\n\nwe need to remove 2 elements,\nthe common min in n1 must be in n1[0] n1[1] n1[2]\nwant n1-n2[0] smaller, n1 must be bigger and smaller than 3\n\n\n# Code\n```\nclass Solution {\npublic:\n    int minimumAddedInteger(vector<int>& nums1, vector<int>& nums2) {\n\n        sort(nums1.begin(),nums1.end());\n        sort(nums2.begin(),nums2.end());\n\n        //the common min is between nums1[0] [1] [2]\n\n        for(int i = 2;i>=0;i--){\n            int tmp;\n            int cnt = 0;\n            int cnt2 = 0;\n            \n            tmp = nums1[i] - nums2[0];  //find the min gap\n\n            //find every elements in nums2\n            //if all found, return the tmp\n\n            for(int j = 0;j<nums1.size();j++){\n                if(nums1[j] - tmp == nums2[cnt2]){\n                    cnt++;\n                    cnt2++;\n                }\n                if(cnt == nums2.size()){\n                    return -tmp;\n                }\n            }\n        }\n        return 0;\n    }\n};\n```
['C++']