Dart Solution
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  int maxDivScore(List<int> nums, List<int> divisors) {\n    var ans = -1;\n    var most = -1;\n\n    for (var d in divisors) {\n      var cnt = nums.where((n) => n % d == 0).length;\n\n      if (cnt > most || (cnt == most && d < ans)) {\n        ans = d;\n        most = cnt;\n      }\n    }\n\n    return ans;\n  }\n}\n```
['Dart']