Simple Java solution -> Beats 74.58%
IntuitionApproachComplexity

Time complexity:
O(mn)


Space complexity:
O(1)

Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
O(mn)

- Space complexity:
O(1)

# Code
```java []
class Solution {
    public int maxDivScore(int[] nums, int[] divisors) {

        int ans = -1, maxCount = -1, count = -1;

        for (int divisor : divisors) {

            count = getCount(nums, divisor);
            if (count > maxCount) {
                maxCount = count;
                ans = divisor;
            } else if (count == maxCount)
                ans = Math.min(ans, divisor);
        }

        return ans;
    }

    private static int getCount(int[] nums, int divisor) {

        int count = 0;

        for (int num : nums)
            if (num % divisor == 0)
                count++;


        return count;
    }
}
```
['Java']