Easiest Solution || C++
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 maxDivScore(vector<int>& nums, vector<int>& divisors) {\n        int min=0,max=0;\n        for(int i=0;i<divisors.size();i++){\n            int count=0;\n            int div=divisors[i];\n            for(int j=0;j<nums.size();j++){\n                if(nums[j]%div==0)\n                    count++;\n            }\n            if(count>=max){\n                if(count>max){\n                    max=count;\n                    min=div;\n                }\n                else{\n                    if(min==0)\n                        min=div;\n                    else{\n                        if(div<min)\n                            min=div;\n                    }\n                }\n            }\n        }\n        return min;\n    }\n};\n```
['C++']