All test cases passed
IntuitionApproachComplexity
Time complexity:

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

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

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def maxDivScore(self, nums: List[int], divisors: List[int]) -> int:
        a = dict()
        nums.sort()
        divisors = list(set(divisors))
        for e in nums:
            for i in divisors:
                if e >= i and e % i == 0:
                    a[i] = 1 + a.get(i, 0)
        a = list(a.items())
        if len(a) == 0:
            return min(divisors)
        a.sort(key=lambda x: [x[1], -x[0]])
        return a[-1][0]
        
```
['Python3']