






def 					lowercase__				(					__snake_case   :							list[int]					,	__snake_case   :							list[int]  ):


					'''simple docstring'''


					UpperCAmelCase_   :				Optional[Any]						=				len(__snake_case  )
					print('The following activities are selected:'  )

					# The first activity is always selected
					UpperCAmelCase_   :				Any						=				0
					print(__snake_case					,	end=','  )

					# Consider rest of the activities
					for j in range(__snake_case  ):
										# If this activity has start time greater than
										# or equal to the finish time of previously
										# selected activity, then select it
										if start[j] >= finish[i]:
															print(__snake_case					,	end=','  )
															UpperCAmelCase_   :				int						=				j


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		__UpperCAmelCase     							=						[1, 3, 0, 5, 8, 5]
		__UpperCAmelCase     							=						[2, 4, 6, 7, 9, 9]
		print_max_activities(start, finish)














from __future__ import annotations




def 					lowercase__				(					__snake_case   :							list[int]					,	__snake_case   :							int  ):


					'''simple docstring'''


					if len(__snake_case  ) < k or k < 0:
										raise ValueError('Invalid Input'  )
					UpperCAmelCase_   :				int						=						sum(array[:k]  )
					for i in range(len(__snake_case  ) - k  ):
										UpperCAmelCase_   :				List[Any]						=						current_sum - array[i] + array[i + k]
										UpperCAmelCase_   :				List[Any]						=						max(__snake_case					,	__snake_case  )
					return max_sum


if __name__ == "__main__":
		from doctest import testmod
		from random import randint

		testmod()
		__UpperCAmelCase     							=						[randint(-1000, 1000) for i in range(100)]
		__UpperCAmelCase     							=						randint(0, 110)
		print(F'The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}')






