


def        UpperCamelCase_(				_A   :list  )->		float:
			UpperCamelCase__					=       0
			while len(_A  ) > 1:
						UpperCamelCase__					=       0
						# Consider two files with minimum cost to be merged
						for _ in range(2  ):
									UpperCamelCase__					=       files.index(min(_A  )  )
									temp += files[min_index]
									files.pop(_A  )
						files.append(_A  )
						optimal_merge_cost += temp
			return optimal_merge_cost


if __name__ == "__main__":
						import doctest

						doctest.testmod()






from abc import ABC, abstractmethod
from argparse import ArgumentParser







class        lowerCamelCase__	(							UpperCAmelCase      ):






			"""simple docstring"""






			@staticmethod
			@abstractmethod
			def 				snake_case__				(							snake_case     ):

						'''simple docstring'''


						raise NotImplementedError()







			@abstractmethod
			def 				snake_case__				(							self     ):

						'''simple docstring'''


						raise NotImplementedError()


