2644. Find the Maximum Divisibility Score

You are given two 0-indexed integer arrays nums and divisors.

The divisibility score of divisors[i] is the number of indices j such that nums[j] is divisible by divisors[i].

Return the integer divisors[i] with the maximum divisibility score. If there is more than one integer with the maximum score, return the minimum of them.

class Solution {
public:
    int maxDivScore(vector<int>& nums, vector<int>& divisors) {
        int res = -1, cnt = -1;
        for(auto d : divisors) {
            int now = 0;
            for(auto n : nums) if(n % d == 0) now += 1;
            if(cnt < now) {
                cnt = now, res = d;
            } else if(cnt == now) {
                res = min(res, d);
            }
        }
        return res;
    }
};