We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is the profit of the ith job. 
Now we have some workers. worker[i] is the ability of the ith worker, which means that this worker can only complete a job with difficulty at most worker[i]. 
Every worker can be assigned at most one job, but one job can be completed multiple times.
For example, if 3 people attempt the same job that pays $1, then the total profit will be $3.  If a worker cannot complete any job, his profit is $0.
What is the most profit we can make?
Example 1:
Input: difficulty = [2,4,6,8,10], profit = [10,20,30,40,50], worker = [4,5,6,7]
Output: 100 
Explanation: Workers are assigned jobs of difficulty [4,4,6,6] and they get profit of [20,20,30,30] seperately.
Notes:

1 <= difficulty.length = profit.length <= 10000
1 <= worker.length <= 10000
difficulty[i], profit[i], worker[i]  are in range [1, 10^5]

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# # Fisrt solution\n# def createListOfProfitDiff(profit, difficulty):\n#     profit_diff = []\n#     for i in range(len(profit)):\n#         profit_diff.append((profit[i], difficulty[i]))\n#     return profit_diff\n        \n        \n        \n# class Solution:\n#     def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int:\n#         profit_diff = createListOfProfitDiff(profit, difficulty)\n#         profit_diff.sort(key=lambda x:x[0])\n#         worker2 = sorted(worker)\n\n#         maxprofit = 0\n#         for i in range(len(profit_diff)-1, -1, -1):\n#             for j in range(len(worker2) -1, -1, -1):\n#                 if profit_diff[i][1]> worker2[j]:\n#                     break\n#                 else:\n#                     maxprofit += profit_diff[i][0]\n#                     worker2.pop(j)\n#         return maxprofit\n# Second solution\ndef createListOfProfitDiff(profit, difficulty):\n    profit_diff = []\n    for i in range(len(profit)):\n        profit_diff.append((profit[i], difficulty[i]))\n    return profit_diff\n        \n        \n        \n# class Solution:\n#     def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int:\n#         profit_diff = createListOfProfitDiff(profit, difficulty)\n#         profit_diff.sort(key=lambda x:x[0])\n#         worker2 = sorted(worker)\n\n#         maxprofit = 0\n#         i = len(profit_diff) -1\n#         j = len(worker2)-1\n#         while i<len(profit_diff) and j <len(worker2) and i>-1 and j>-1:\n#             if profit_diff[i][1]> worker2[j]:\n#                 i-=1\n#             else:\n#                 maxprofit += profit_diff[i][0]\n#                 worker2.pop(j)\n#                 j-=1\n#         return maxprofit\n\nclass Solution:\n    def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int:\n        w = sorted(worker)\n        w.reverse()\n        dp = []\n        for i in range(len(profit)):\n            dp.append((profit[i], difficulty[i]))\n        dp.sort(key =  lambda x:x[0])\n        dp.reverse()\n\n        i = 0\n        count = 0\n        for p in dp:\n            while i<len(w) and p[1] <= w[i]:\n                count += p[0]\n                i+=1\n        return count\n                \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'maxProfitAssignment'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6118