



import math
import sys






class 				SCREAMING_SNAKE_CASE    :





							def __init__(				self						:						Tuple		):

											'''simple docstring'''
											__a					       =						0
											__a					       =						[]
											__a					       =						{}  # To store the pos of node in array





							def   UpperCamelCase_   (				self						:						List[str]		):

											'''simple docstring'''
											return self.cur_size == 0





							def   UpperCamelCase_   (				self						:						Tuple ,			__lowercase						:						int		):

											'''simple docstring'''
											__a					       =						self.left(__lowercase		)
											__a					       =						self.right(__lowercase		)
											if lc < self.cur_size and self.array(__lowercase		)[0] < self.array(__lowercase		)[0]:
															__a					       =						lc
											else:
															__a					       =						idx
											if rc < self.cur_size and self.array(__lowercase		)[0] < self.array(__lowercase		)[0]:
															__a					       =						rc
											if smallest != idx:
															self.swap(__lowercase ,			__lowercase		)
															self.min_heapify(__lowercase		)





							def   UpperCamelCase_   (				self						:						List[str] ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											__a					       =						self.cur_size
											self.cur_size += 1
											self.array.append((sys.maxsize, tup[1])		)
											self.decrease_key((sys.maxsize, tup[1]) ,			tup[0]		)





							def   UpperCamelCase_   (				self						:						List[Any]		):

											'''simple docstring'''
											__a					       =						self.array[0][1]
											__a					       =						self.array[self.cur_size - 1]
											self.cur_size -= 1
											self.min_heapify(1		)
											del self.pos[min_node]
											return min_node





							def   UpperCamelCase_   (				self						:						int ,			__lowercase						:						Dict		):

											'''simple docstring'''
											return 2 * i + 1





							def   UpperCamelCase_   (				self						:						Any ,			__lowercase						:						Dict		):

											'''simple docstring'''
											return 2 * i + 2





							def   UpperCamelCase_   (				self						:						int ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											return math.floor(i / 2		)





							def   UpperCamelCase_   (				self						:						List[str] ,			__lowercase						:						List[str] ,			__lowercase						:						Dict		):

											'''simple docstring'''
											__a					       =						j
											__a					       =						i
											__a					       =						self.array[i]
											__a					       =						self.array[j]
											__a					       =						temp







							def   UpperCamelCase_   (				self						:						Tuple ,			__lowercase						:						Any ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											__a					       =						self.pos[tup[1]]
											# assuming the new_d is atmost old_d
											__a					       =						(new_d, tup[1])
											while idx > 0 and self.array[self.par(__lowercase		)][0] > self.array[idx][0]:
															self.swap(__lowercase ,			self.par(__lowercase		)		)
															__a					       =						self.par(__lowercase		)






class 				SCREAMING_SNAKE_CASE    :





							def __init__(				self						:						Tuple ,			__lowercase						:						List[Any]		):

											'''simple docstring'''
											__a					       =						{}  # To store graph: u -> (v,w)
											__a					       =						num  # Number of nodes in graph
											# To store the distance from source vertex
											__a					       =						[0] * self.num_nodes
											__a					       =						[-1] * self.num_nodes  # To store the path





							def   UpperCamelCase_   (				self						:						int ,			__lowercase						:						int ,			__lowercase						:						List[Any] ,			__lowercase						:						Optional[int]		):

											'''simple docstring'''
											#  Edge going from node u to v and v to u with weight w
											# u (w)-> v, v (w) -> u
											# Check if u already in graph
											if u in self.adjList:
															self.adjList[u].append((v, w)		)
											else:
															__a					       =						[(v, w)]

											# Assuming undirected graph
											if v in self.adjList:
															self.adjList[v].append((u, w)		)
											else:
															__a					       =						[(u, w)]





							def   UpperCamelCase_   (				self						:						Optional[Any]		):

											'''simple docstring'''
											# u -> v(w)
											for u in self.adjList:
															print(__lowercase ,			"""->""" ,			""" -> """.join(str(F"{v}({w})"		) for v, w in self.adjList[u]		)		)





							def   UpperCamelCase_   (				self						:						Tuple ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											__a					       =						[-1] * self.num_nodes
											# src is the source node
											__a					       =						0
											__a					       =						PriorityQueue()
											q.insert((0, src)		)  # (dist from src, node)
											for u in self.adjList:
															if u != src:
																			__a					       =						sys.maxsize  # Infinity
																			__a					       =						-1

											while not q.is_empty():
															__a					       =						q.extract_min()  # Returns node with the min dist from source
															# Update the distance of all the neighbours of u and
															# if their prev dist was INFINITY then push them in Q
															for v, w in self.adjList[u]:
																			__a					       =						self.dist[u] + w
																			if self.dist[v] > new_dist:
																							if self.dist[v] == sys.maxsize:
																											q.insert((new_dist, v)		)
																							else:
																											q.decrease_key((self.dist[v], v) ,			__lowercase		)
																							__a					       =						new_dist
																							__a					       =						u

        # Show the shortest distances from src
											self.show_distances(__lowercase		)





							def   UpperCamelCase_   (				self						:						Dict ,			__lowercase						:						Dict		):

											'''simple docstring'''
											print(F"Distance from node: {src}"		)
											for u in range(self.num_nodes		):
															print(F"Node {u} has distance: {self.dist[u]}"		)







							def   UpperCamelCase_   (				self						:						Optional[int] ,			__lowercase						:						Dict ,			__lowercase						:						Dict		):

											'''simple docstring'''
											__a					       =						[]
											__a					       =						0
											__a					       =						dest
											# Backtracking from dest to src
											while self.par[temp] != -1:
															path.append(__lowercase		)
															if temp != src:
																			for v, w in self.adjList[temp]:
																							if v == self.par[temp]:
																											cost += w
																											break
															__a					       =						self.par[temp]
											path.append(__lowercase		)
											path.reverse()

											print(F"----Path to reach {dest} from {src}----"		)
											for u in path:
															print(F"{u}" ,			end=""" """		)
															if u != dest:
																			print("""-> """ ,			end=""""""		)

											print("""\nTotal cost of path: """ ,			__lowercase		)


if __name__ == "__main__":
						lowerCamelCase__     =	Graph(9)
						graph.add_edge(0, 1, 4)
						graph.add_edge(0, 7, 8)
						graph.add_edge(1, 2, 8)
						graph.add_edge(1, 7, 11)
						graph.add_edge(2, 3, 7)
						graph.add_edge(2, 8, 2)
						graph.add_edge(2, 5, 4)
						graph.add_edge(3, 4, 9)
						graph.add_edge(3, 5, 14)
						graph.add_edge(4, 5, 10)
						graph.add_edge(5, 6, 2)
						graph.add_edge(6, 7, 1)
						graph.add_edge(6, 8, 6)
						graph.add_edge(7, 8, 7)
						graph.show_graph()
						graph.dijkstra(0)
						graph.show_path(0, 4)

# OUTPUT
# 0 -> 1(4) -> 7(8)
# 1 -> 0(4) -> 2(8) -> 7(11)
# 7 -> 0(8) -> 1(11) -> 6(1) -> 8(7)
# 2 -> 1(8) -> 3(7) -> 8(2) -> 5(4)
# 3 -> 2(7) -> 4(9) -> 5(14)
# 8 -> 2(2) -> 6(6) -> 7(7)
# 5 -> 2(4) -> 3(14) -> 4(10) -> 6(2)
# 4 -> 3(9) -> 5(10)
# 6 -> 5(2) -> 7(1) -> 8(6)
# Distance from node: 0
# Node 0 has distance: 0
# Node 1 has distance: 4
# Node 2 has distance: 12
# Node 3 has distance: 19
# Node 4 has distance: 21
# Node 5 has distance: 11
# Node 6 has distance: 9
# Node 7 has distance: 8
# Node 8 has distance: 14
# ----Path to reach 4 from 0----
# 0 -> 7 -> 6 -> 5 -> 4
# Total cost of path:  21





#
# Sort large text files in a minimum amount of memory
#
import argparse
import os






class 				SCREAMING_SNAKE_CASE     :
							__lowerCamelCase		:		Tuple      ='block_{0}.dat'





							def __init__(				self						:						int ,			__lowercase						:						Dict		):

											'''simple docstring'''
											__a					       =						filename
											__a					       =						[]





							def   UpperCamelCase_   (				self						:						int ,			__lowercase						:						Dict ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											__a					       =						self.BLOCK_FILENAME_FORMAT.format(__lowercase		)
											with open(__lowercase ,			"""w"""		) as file:
															file.write(__lowercase		)
											self.block_filenames.append(__lowercase		)





							def   UpperCamelCase_   (				self						:						List[str]		):

											'''simple docstring'''
											return self.block_filenames





							def   UpperCamelCase_   (				self						:						Any ,			__lowercase						:						str ,			__lowercase						:						Tuple=None		):

											'''simple docstring'''
											__a					       =						0
											with open(self.filename		) as file:
															while True:
																			__a					       =						file.readlines(__lowercase		)

																			if lines == []:
																							break

																			if sort_key is None:
																							lines.sort()
																			else:
																							lines.sort(key=__lowercase		)

																			self.write_block("""""".join(__lowercase		) ,			__lowercase		)
																			i += 1







							def   UpperCamelCase_   (				self						:						List[Any]		):

											'''simple docstring'''
											map(os.remove ,			self.block_filenames		)






class 				SCREAMING_SNAKE_CASE     :





							def   UpperCamelCase_   (				self						:						Dict ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											__a					       =						-1
											__a					       =						None

											for i in range(len(__lowercase		)		):
															if min_str is None or choices[i] < min_str:
																			__a					       =						i

											return min_index






class 				SCREAMING_SNAKE_CASE     :





							def __init__(				self						:						Optional[int] ,			__lowercase						:						Optional[Any]		):

											'''simple docstring'''
											__a					       =						files
											__a					       =						set()
											__a					       =						len(__lowercase		)
											__a					       =						{i: None for i in range(self.num_buffers		)}





							def   UpperCamelCase_   (				self						:						int		):

											'''simple docstring'''
											return {
											    i: self.buffers[i] for i in range(self.num_buffers		) if i not in self.empty
											}





							def   UpperCamelCase_   (				self						:						List[str]		):

											'''simple docstring'''
											for i in range(self.num_buffers		):
															if self.buffers[i] is None and i not in self.empty:
																			__a					       =						self.files[i].readline()

																			if self.buffers[i] == "":
																							self.empty.add(__lowercase		)
																							self.files[i].close()

											if len(self.empty		) == self.num_buffers:
															return False

											return True







							def   UpperCamelCase_   (				self						:						List[str] ,			__lowercase						:						List[Any]		):

											'''simple docstring'''
											__a					       =						self.buffers[index]
											__a					       =						None

											return value






class 				SCREAMING_SNAKE_CASE     :





							def __init__(				self						:						Optional[int] ,			__lowercase						:						Any		):

											'''simple docstring'''
											__a					       =						merge_strategy





							def   UpperCamelCase_   (				self						:						str ,			__lowercase						:						Union[str, Any] ,			__lowercase						:						List[str] ,			__lowercase						:						Dict		):

											'''simple docstring'''
											__a					       =						FilesArray(self.get_file_handles(__lowercase ,			__lowercase		)		)
											with open(__lowercase ,			"""w""" ,			__lowercase		) as outfile:
															while buffers.refresh():
																			__a					       =						self.merge_strategy.select(buffers.get_dict()		)
																			outfile.write(buffers.unshift(__lowercase		)		)







							def   UpperCamelCase_   (				self						:						List[Any] ,			__lowercase						:						str ,			__lowercase						:						Dict		):

											'''simple docstring'''
											__a					       =						{}

											for i in range(len(__lowercase		)		):
															__a					       =						open(filenames[i] ,			"""r""" ,			__lowercase		)  # noqa: UP015

											return files






class 				SCREAMING_SNAKE_CASE     :





							def __init__(				self						:						str ,			__lowercase						:						Tuple		):

											'''simple docstring'''
											__a					       =						block_size





							def   UpperCamelCase_   (				self						:						Tuple ,			__lowercase						:						str ,			__lowercase						:						Union[str, Any]=None		):

											'''simple docstring'''
											__a					       =						self.get_number_blocks(__lowercase ,			self.block_size		)
											__a					       =						FileSplitter(__lowercase		)
											splitter.split(self.block_size ,			__lowercase		)

											__a					       =						FileMerger(NWayMerge()		)
											__a					       =						self.block_size / (num_blocks + 1)
											merger.merge(splitter.get_block_filenames() ,			filename + """.out""" ,			__lowercase		)

											splitter.cleanup()







							def   UpperCamelCase_   (				self						:						str ,			__lowercase						:						Optional[Any] ,			__lowercase						:						Dict		):

											'''simple docstring'''
											return (os.stat(__lowercase		).st_size / block_size) + 1



def 					lowerCAmelCase__  (							_SCREAMING_SNAKE_CASE    :     Tuple      ):
				"""simple docstring"""







				if string[-1].lower() == "k":
								return int(string[:-1]      ) * 1024
				elif string[-1].lower() == "m":
								return int(string[:-1]      ) * 1024 * 1024
				elif string[-1].lower() == "g":
								return int(string[:-1]      ) * 1024 * 1024 * 1024
				else:
								return int(_SCREAMING_SNAKE_CASE      )

def 					lowerCAmelCase__  (							):
				"""simple docstring"""







				__a					       =						argparse.ArgumentParser()
				parser.add_argument(
				    """-m"""			,       """--mem"""			,       help="""amount of memory to use for sorting"""			,       default="""100M"""      )
				parser.add_argument(
				    """filename"""			,       metavar="""<filename>"""			,       nargs=1			,       help="""name of file to sort"""      )
				__a					       =						parser.parse_args()

				__a					       =						ExternalSort(parse_memory(args.mem      )      )
				sorter.sort(args.filename[0]      )


if __name__ == "__main__":
						main()
