Easy Java Solution (Not good Beats though)
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 maxDivScore(int[] nums, int[] divisors) {\n        int score[][] = new int[divisors.length][2];\n        for(int i=0; i<divisors.length; i++) {\n            int count = 0;\n            for(int j=0; j<nums.length; j++) {\n                if(nums[j] % divisors[i] == 0) {\n                    count++;\n                }\n            }\n            score[i][0] = divisors[i];\n            score[i][1] = count;\n        }\n        Arrays.sort(score, Comparator.comparingDouble(o -> o[1]));\n\n        ArrayList<Integer> ansList = new ArrayList<>();\n        ansList.add(score[score.length-1][0]);\n        for(int k=score.length-2; k>=0; k--) {\n            if(score[score.length-1][1]==score[k][1]) {\n                ansList.add(score[k][0]);\n            }\n        }\n\n        Collections.sort(ansList);\n        return ansList.get(0);\n    }\n}\n```
['Java']