Easy JAVA 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```java []\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int res = -1, max = 0;\n        for(int d : divisors) {\n            int ct = 0;\n            for(int n : nums) {\n                if(n % d == 0)\n                    ct++;\n            }\n            if(ct == max) {\n                if(res == -1)\n                    res = d;\n                else\n                    res = Math.min(res, d);\n            }\n            if(ct > max) {\n                max = ct;\n                res = d;\n            }\n        }\n        return res;\n    }\n}\n```
['Java']