

from typing import Callable







def a_		(       UpperCamelCase_   :							Callable  )							->   Dict:







 """simple docstring"""

 def wrapper(UpperCamelCase_   :							str  ):
  lowerCamelCase      						=    function_with_docstring.__doc__
  return target_function

 return wrapper









def a_		(       UpperCamelCase_   :							int   ,					UpperCamelCase_   :							list  )							->   list:







 """simple docstring"""

 lowerCamelCase      						=    sorted(UpperCamelCase_   ,					key=lambda UpperCamelCase_  : value[2]   ,					reverse=UpperCamelCase_  )

 # Create a list of size equal to the maximum deadline
 # and initialize it with -1
 lowerCamelCase      						=    max(UpperCamelCase_   ,					key=lambda UpperCamelCase_  : value[1]  )[1]
 lowerCamelCase      						=    [-1] * max_deadline

 # Finding the maximum profit and the count of jobs
 lowerCamelCase      						=    0
 lowerCamelCase      						=    0
 for job in jobs:
  # Find a free time slot for this job
  # (Note that we start from the last possible slot)
  for i in range(job[1] - 1   ,					-1   ,					-1  ):
   if time_slots[i] == -1:
    lowerCamelCase      						=    job[0]
    count += 1
    max_profit += job[2]
    break
 return [count, max_profit]


if __name__ == "__main__":
     import doctest

     doctest.testmod()




