C++ 10 line 4ms
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:\nO(NlogN)\n\n- Space complexity:\nO(1)\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int minimumAddedInteger(vector<int>& a, vector<int>& b) {\n        auto f = [&](int i){\n            int x = b[0] - a[i], num_skip = 2-i;\n            for(int j=0; j<b.size(); i++,j++){\n                while((a[i] + x != b[j]) && num_skip-- >0) i++;\n                if(num_skip <0) return INT_MAX;\n            }\n            return x;\n        };\n        ranges::sort(a);\n        ranges::sort(b);\n        return min({f(0),f(1),f(2)});\n    }\n};\n```
['C++']