Java Very Easy 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 {\n    public int minimumAddedInteger(int[] nums1, int[] nums2) {\n        int min = Integer.MAX_VALUE;\n        int n1 = nums1.length;\n        int n2 = nums2.length;\n        \n        Arrays.sort(nums1);\n        Arrays.sort(nums2);\n        int k = 0;\n        // int idx = 0;\n        while(k<nums1.length){\n            boolean vis[] = new boolean[n1];\n            int diff = nums2[0]-nums1[k];\n            int cnt = 0;\n            for(int j = 0 ; j<nums2.length ; j++){\n                for(int i = 0 ; i<nums1.length ; i++){\n                    if(nums2[j]-nums1[i] == diff){\n                        if(vis[i] == false){\n                            cnt++;\n                            vis[i] = true;\n                            break;\n                        }\n                    }\n                }\n            }\n            if(cnt == nums2.length){\n                min = Math.min(min,diff);\n            }\n            k++;\n        }\n        return min;\n    }\n}\n```
['Java']