Java
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        Map<Integer, Integer> map = new HashMap<>();\n        for (int divisor : divisors) {\n            int count = 0;\n            for (int num : nums) {\n                if (num % divisor == 0) count++;\n            }\n            map.put(divisor, count);\n        }\n        Comparator<Map.Entry<Integer, Integer>> first = Map.Entry.comparingByValue();\n        Comparator<Map.Entry<Integer, Integer>> second = Map.Entry.comparingByKey();\n        return map.entrySet().stream()\n                .min(first.reversed().thenComparing(second))\n                .get()\n                .getKey();\n    }\n}\n```
['Java']