"""simple docstring"""




def 				_UpperCAmelCase		(							lowerCamelCase__  ):





		"""simple docstring"""




		lowerCAmelCase__   = len(lowerCamelCase__  )
		lowerCAmelCase__   = sum(lowerCamelCase__  )

		lowerCAmelCase__   = [[False for x in range(s + 1  )] for y in range(n + 1  )]

		for i in range(1      ,	n + 1  ):
				lowerCAmelCase__   = True

		for i in range(1      ,	s + 1  ):
				lowerCAmelCase__   = False

		for i in range(1      ,	n + 1  ):
				for j in range(1      ,	s + 1  ):
						lowerCAmelCase__   = dp[i][j - 1]

						if arr[i - 1] <= j:
								lowerCAmelCase__   = dp[i][j] or dp[i - 1][j - arr[i - 1]]

		for j in range(int(s / 2  )      ,	-1      ,	-1  ):
				if dp[n][j] is True:
						lowerCAmelCase__   = s - 2 * j
						break

		return diff





"""simple docstring"""




from __future__ import annotations

from statistics import mean







def 				_UpperCAmelCase		(							lowerCamelCase__      ,	lowerCamelCase__      ,	lowerCamelCase__  ):





		"""simple docstring"""




		lowerCAmelCase__   = [0] * no_of_processes
		lowerCAmelCase__   = [0] * no_of_processes

		# Initialize remaining_time to waiting_time.

		for i in range(lowerCamelCase__  ):
				lowerCAmelCase__   = burst_time[i]
		lowerCAmelCase__   = []

		lowerCAmelCase__   = 0
		lowerCAmelCase__   = 0

		# When processes are not completed,
		# A process whose arrival time has passed \
		# and has remaining execution time is put into the ready_process.
		# The shortest process in the ready_process, target_process is executed.

		while completed != no_of_processes:
				lowerCAmelCase__   = []
				lowerCAmelCase__   = -1

				for i in range(lowerCamelCase__  ):
						if (arrival_time[i] <= total_time) and (remaining_time[i] > 0):
								ready_process.append(lowerCamelCase__  )

				if len(lowerCamelCase__  ) > 0:
						lowerCAmelCase__   = ready_process[0]
						for i in ready_process:
								if remaining_time[i] < remaining_time[target_process]:
										lowerCAmelCase__   = i
						total_time += burst_time[target_process]
						completed += 1
						lowerCAmelCase__   = 0
						lowerCAmelCase__   = (
						    total_time - arrival_time[target_process] - burst_time[target_process]
						)
				else:
						total_time += 1

		return waiting_time







def 				_UpperCAmelCase		(							lowerCamelCase__      ,	lowerCamelCase__      ,	lowerCamelCase__  ):





		"""simple docstring"""




		lowerCAmelCase__   = [0] * no_of_processes
		for i in range(lowerCamelCase__  ):
				lowerCAmelCase__   = burst_time[i] + waiting_time[i]
		return turn_around_time


if __name__ == "__main__":
			print("[TEST CASE 01]")

			__lowerCAmelCase     :				str    				=    4
			__lowerCAmelCase     :				Dict    				=    [2, 5, 3, 7]
			__lowerCAmelCase     :				List[str]    				=    [0, 0, 0, 0]
			__lowerCAmelCase     :				Union[str, Any]    				=    calculate_waitingtime(arrival_time, burst_time, no_of_processes)
			__lowerCAmelCase     :				Union[str, Any]    				=    calculate_turnaroundtime(
			    burst_time, no_of_processes, waiting_time
			)

			# Printing the Result
			print("PID\tBurst Time\tArrival Time\tWaiting Time\tTurnaround Time")
			for i, process_id in enumerate(list(range(1, 5))):
						print(
						    F"{process_id}\t{burst_time[i]}\t\t\t{arrival_time[i]}\t\t\t\t"
						    F"{waiting_time[i]}\t\t\t\t{turn_around_time[i]}"
						)
			print(F"\nAverage waiting time = {mean(waiting_time):.5f}")
			print(F"Average turnaround time = {mean(turn_around_time):.5f}")




