826

class Solution {
public:
    int maxProfitAssignment(vector<int>& difficulty, vector<int>& profit, vector<int>& worker) {
        vector<pair<int, int>> jobs;
        for(int i=0; i<difficulty.size(); i++)
            jobs.push_back({difficulty[i], profit[i]});
        sort(jobs.begin(), jobs.end());
        sort(worker.begin(), worker.end());

        int left=0, best=0, ans=0;
        for(int x:worker){
            while(left < jobs.size() && x >= jobs[left].first)
                best = max(best, jobs[left++].second);
            ans += best;
        }
        return ans;
    }
};