C# Bests 96.15%
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: O(m x n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```csharp []\npublic class Solution {\n    public int MaxDivScore(int[] nums, int[] divisors) {\n        int maxCount = 0;\n        int minResult = int.MaxValue;\n        foreach(int div in divisors){\n            int count = 0;\n\n            foreach(int num in nums){\n                if(num % div == 0){\n                    count++;\n                }\n            }\n\n            if(count > maxCount || (count == maxCount && div < minResult)){\n                maxCount = count;\n                minResult = div;\n            }\n        }\n        return minResult;\n\n    }\n}\n```
['C#']