int maxSubjectsNumber(vector<int> answered, vector<int> needed, int q) {
    vector<pair<int, int>> subjects;
    for (int i = 0; i < answered.size(); i++) {
        subjects.push_back(make_pair(answered[i], needed[i]));
    }
    sort(subjects.begin(), subjects.end(), [](const pair<int, int>& a, const pair<int, int>& b) {
        return (a.second - a.first) < (b.second - b.first);
    });

    int subjectsPassed = 0;
    for (const auto& subject : subjects) {
        int answered = subject.first;
        int needed = subject.second;

        if (answered >= needed) {
            subjectsPassed++;
        } else if (q >= (needed - answered)) {
            subjectsPassed++;
            q -= (needed - answered);
        } else {
            break;
        }
    }

    return subjectsPassed;
}

Amazon ✅

OR query ✅

Find the value ✅
Python 3

Increasing Division
Python 3✅