





'''simple docstring'''







def      _lowerCAmelCase		(		lowercase      ,			lowercase			)      ->      list:
			__lowerCAmelCase      		=       sorted(lowercase      ,			key=lambda lowercase			: value[2]      ,			reverse=lowercase			)

			# Create a list of size equal to the maximum deadline
			# and initialize it with -1
			__lowerCAmelCase      		=       max(lowercase      ,			key=lambda lowercase			: 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()









'''simple docstring'''







def      _lowerCAmelCase		(		lowercase = 1000			)      ->      int:
			__lowerCAmelCase      		=       []
			__lowerCAmelCase      		=       []
			__lowerCAmelCase      		=       3
			__lowerCAmelCase      		=       5
			__lowerCAmelCase      		=       1
			while True:
						__lowerCAmelCase      		=       z * temp
						if result < n:
									zmulti.append(lowercase			)
									temp += 1
						else:
									__lowerCAmelCase      		=       1
									break
			while True:
						__lowerCAmelCase      		=       x * temp
						if result < n:
									xmulti.append(lowercase			)
									temp += 1
						else:
									break
			__lowerCAmelCase      		=       list(set(xmulti + zmulti			)			)
			return sum(lowercase			)


if __name__ == "__main__":
	print(f'{solution() = }')

