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\n#         def binary_search(intervals, index):\n\n#             start = 0\n#             end = index - 1\n\n#             while start <= end:\n#                 mid = (start + end) // 2\n\n#                 if intervals[index][0] < intervals[mid][1]:\n#                     end = mid - 1\n#                 else:\n#                     start = mid + 1\n\n#             return start - 1\n        \n        def binary_search(intervals, index):\n\n            start = 0\n            end = index\n\n            while start < end:\n                mid = (start + end) // 2\n\n                if intervals[mid][1] > intervals[index][0]:\n                    end = mid\n                else:\n                    start = mid + 1\n\n            return start - 1\n        \n        \n\n        intervals = []\n        for i in range(len(startTime)):\n            intervals.append((startTime[i], endTime[i], profit[i]))\n\n        intervals.sort(key=lambda i: i[1])\n        # print(intervals)\n        # see other submitted code for clear explanation\n        dp = [0] * len(intervals)\n        for i in range(len(intervals)):\n            profit_if_i_inlcuded = intervals[i][2]\n\n            k_th = binary_search(intervals, i)\n            \n            if (k_th != -1):\n                profit_if_i_inlcuded += dp[k_th]\n\n            dp[i] = max(dp[i - 1], profit_if_i_inlcuded)  # max of not including i, including i\n            # print(intervals, i, k_th, dp)\n        return max(dp)\n\n    # almost all  test cases passed\n#     def jobScheduling_n2(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:\n\n#         def binary_search(intervals, index):\n\n#             start = 0\n#             end = index - 1\n\n#             while start <= end:\n#                 mid = (start + end) // 2\n\n#                 if intervals[index][0] < intervals[mid][1]:\n#                     end = mid - 1\n#                 else:\n#                     start = mid + 1\n\n#             return start - 1\n\n#         intervals = []\n#         for i in range(len(startTime)):\n#             intervals.append((startTime[i], endTime[i], profit[i]))\n\n#         intervals.sort(key=lambda i: i[1])\n#         # print(intervals)\n#         dp = [0] * len(intervals)\n#         for i in range(len(intervals)):\n#             dp[i] = intervals[i][2]\n\n#             k_th = binary_search(intervals, i)\n\n#             if k_th != -1:\n#                 for j in range(0, k_th + 1):\n#                     if dp[i] < dp[j] + intervals[i][2]:\n#                         dp[i] = dp[j] + intervals[i][2]\n\n#         # print(dp)\n#         return max(dp)\n\n#     def jobScheduling_n2(self, startTime: List[int], endTime: List[int], profit: List[int]) -> int:\n\n#         intervals = []\n#         for i in range(len(startTime)):\n#             intervals.append((startTime[i], endTime[i], profit[i]))\n\n#         intervals.sort(key=lambda i: i[1])\n#         # print(intervals)\n#         dp = [0] * len(intervals)\n#         for i in range(len(intervals)):\n#             dp[i] = intervals[i][2]\n\n#             for j in range(0, i):\n\n#                 if intervals[i][0] >= intervals[j][1]:\n#                     if dp[i] < dp[j] + intervals[i][2]:\n#                         dp[i] = dp[j] + intervals[i][2]\n\n#         # print(dp)\n#         return max(dp)\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: 6322