We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].
You're given the startTime , endTime and profit arrays, you need to output the maximum profit you can take such that there are no 2 jobs in the subset with overlapping time range.
If you choose a job that ends at time X you will be able to start another job that starts at time X.
 
Example 1:

Input: startTime = [1,2,3,3], endTime = [3,4,5,6], profit = [50,10,40,70]
Output: 120
Explanation: The subset chosen is the first and fourth job. 
Time range [1-3]+[3-6] , we get profit of 120 = 50 + 70.

Example 2:
 

Input: startTime = [1,2,3,4,6], endTime = [3,5,10,6,9], profit = [20,20,100,70,60]
Output: 150
Explanation: The subset chosen is the first, fourth and fifth job. 
Profit obtained 150 = 20 + 70 + 60.

Example 3:

Input: startTime = [1,1,1], endTime = [2,3,4], profit = [5,6,4]
Output: 6

 
Constraints:

1 <= startTime.length == endTime.length == profit.length <= 5 * 10^4
1 <= startTime[i] < endTime[i] <= 10^9
1 <= profit[i] <= 10^4

```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 = 'class Solution:\n    def jobScheduling(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:\n        #用空间存在startTime开始前最大的profit\n        #像找零钱一样写的话，会很慢\n#         jobs = []\n#         for i in range(len(startTime)):\n#             jobs.append([startTime[i], endTime[i], profit[i]])\n#         jobs.sort(key = lambda x:x[1])\n        \n#         dict1 = {}\n#         for job in jobs:\n#             if job[1] not in dict1:\n#                 dict1[job[1]] = [job]\n#             else:\n#                 dict1[job[1]].append(job)\n#         tail = jobs[-1][1]\n#         dp = [0 for _ in range(tail + 1)]\n        \n#         for i in range(1, len(dp)):\n#             dp[i] = dp[i-1]\n#             if i in dict1:\n#                 for job in dict1[i]:\n#                     startTime = job[0]\n#                     dp[i] = max(dp[i], dp[startTime] + job[2])\n#         #print(dp)\n#         return dp[-1]\n\n        #因为仅有做决定的点有用，所以我们不需要把所有的点取下来，仅需要存每次做决定产生的最大值\n        #就像找零钱，每次做决定的时候，找dp[cur - value]\n        #但是因为我们只存了稀疏的链表结构，需要在存的结果中找那个对应的dp[cur - value]的点\n        \n        def bs(list1, target):\n            left = 0\n            right = len(list1) - 1\n            while left < right - 1:\n                mid = (left + right) // 2\n                if target == list1[mid][0]:\n                    return list1[mid]\n                elif target > list1[mid][0]:\n                    left = mid\n                else:\n                    right = mid - 1\n            if list1[right][0] > target:\n                return list1[left]\n            else:\n                return list1[right]\n            \n        jobs = []\n        for i in range(len(startTime)):\n            jobs.append([startTime[i], endTime[i], profit[i]])\n        jobs.sort(key = lambda x:x[1])\n        dp = [[0, 0]]\n        for job in jobs:\n            maxLast = bs(dp, job[0])[1]\n            if maxLast + job[2] > dp[-1][1]:\n                dp.append([job[1], maxLast + job[2]])\n        return dp[-1][1]\n            \n        \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'jobScheduling'
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: 6622