





def     _UpperCamelCase     (a__   :list   ,			a__   :list   ,			a__   :int       ):






							"""simple docstring"""





							if len(a__       ) != len(a__       ):
														raise ValueError("""The length of profit and weight must be same."""       )
							if max_weight <= 0:
														raise ValueError("""max_weight must greater than zero."""       )
							if any(p < 0 for p in profit       ):
														raise ValueError("""Profit can not be negative."""       )
							if any(w < 0 for w in weight       ):
														raise ValueError("""Weight can not be negative."""       )

							# List created to store profit gained for the 1kg in case of each weight
							# respectively.  Calculate and append profit/weight for each element.
							UpperCamelCase__				     =			[p / w for p, w in zip(a__   ,			a__       )]

							# Creating a copy of the list and sorting profit/weight in ascending order
							UpperCamelCase__				     =			sorted(a__       )

							# declaring useful variables
							UpperCamelCase__				     =			len(a__       )
							UpperCamelCase__				     =			0
							UpperCamelCase__				     =			0
							UpperCamelCase__				     =			0

							# loop till the total weight do not reach max limit e.g. 15 kg and till i<length
							while limit <= max_weight and i < length:
														# flag value for encountered greatest element in sorted_profit_by_weight
														UpperCamelCase__				     =			sorted_profit_by_weight[length - i - 1]
														UpperCamelCase__				     =			profit_by_weight.index(a__       )
														UpperCamelCase__				     =			-1

														# check if the weight encountered is less than the total weight
														# encountered before.
														if max_weight - limit >= weight[index]:
																					limit += weight[index]
																					# Adding profit gained for the given weight 1 ===
																					# weight[index]/weight[index]
																					gain += 1 * profit[index]
														else:
																					# Since the weight encountered is greater than limit, therefore take the
																					# required number of remaining kgs and calculate profit for it.
																					# weight remaining / weight[index]
																					gain += (max_weight - limit) / weight[index] * profit[index]
																					break
														i += 1
							return gain


if __name__ == "__main__":
					print(
					    "Input profits, weights, and then max_weight (all positive ints) separated by "
					    "spaces."
					)

					UpperCamelCase__											= [int(x) for x in input("Input profits separated by spaces: ").split()]
					UpperCamelCase__											= [int(x) for x in input("Input weights separated by spaces: ").split()]
					UpperCamelCase__											= int(input("Max weight allowed: "))

					# Function Call
					calc_profit(profit, weight, max_weight)











from __future__ import annotations

from collections import deque
from collections.abc import Sequence
from dataclasses import dataclass
from typing import Any

@dataclass
class        __SCREAMING_SNAKE_CASE					:
							snake_case     :      int
							snake_case     :      Node | None						     =       None
							snake_case     :      Node | None						     =       None






def     _UpperCamelCase     ():






							"""simple docstring"""





							UpperCamelCase__				     =			Node(1       )
							UpperCamelCase__				     =			Node(2       )
							UpperCamelCase__				     =			Node(3       )
							UpperCamelCase__				     =			Node(4       )
							UpperCamelCase__				     =			Node(5       )
							return tree





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							return [root.data, *preorder(root.left       ), *preorder(root.right       )] if root else []





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							return postorder(root.left       ) + postorder(root.right       ) + [root.data] if root else []





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							return [*inorder(root.left       ), root.data, *inorder(root.right       )] if root else []





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							return (max(height(root.left       )   ,			height(root.right       )       ) + 1) if root else 0





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							UpperCamelCase__				     =			[]

							if root is None:
														return output

							UpperCamelCase__				     =			deque([root]       )

							while process_queue:
														UpperCamelCase__				     =			process_queue.popleft()
														output.append(node.data       )

														if node.left:
																					process_queue.append(node.left       )
														if node.right:
																					process_queue.append(node.right       )
							return output





def     _UpperCamelCase     (a__   :Node | None   ,			a__   :int       ):






							"""simple docstring"""





							UpperCamelCase__				     =			[]

							def populate_output(a__   :Node | None   ,			a__   :int       ) -> None:
														if not root:
																					return
														if level == 1:
																					output.append(root.data       )
														elif level > 1:
																					populate_output(root.left   ,			level - 1       )
																					populate_output(root.right   ,			level - 1       )

							populate_output(a__   ,			a__       )
							return output





def     _UpperCamelCase     (a__   :Node | None   ,			a__   :int       ):






							"""simple docstring"""





							UpperCamelCase__				     =			[]

							def populate_output(a__   :Node | None   ,			a__   :int       ) -> None:
														if root is None:
																					return
														if level == 1:
																					output.append(root.data       )
														elif level > 1:
																					populate_output(root.right   ,			level - 1       )
																					populate_output(root.left   ,			level - 1       )

							populate_output(a__   ,			a__       )
							return output





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							if root is None:
														return []

							UpperCamelCase__				     =			[]

							UpperCamelCase__				     =			0
							UpperCamelCase__				     =			height(a__       )

							for h in range(1   ,			height_tree + 1       ):
														if not flag:
																					output.append(get_nodes_from_left_to_right(a__   ,			a__       )       )
																					UpperCamelCase__				     =			1
														else:
																					output.append(get_nodes_from_right_to_left(a__   ,			a__       )       )
																					UpperCamelCase__				     =			0

							return output





def     _UpperCamelCase     ():  # Main function for testing.






							"""simple docstring"""





							UpperCamelCase__				     =			make_tree()
							print(f"""In-order Traversal: {inorder(a__       )}"""       )
							print(f"""Pre-order Traversal: {preorder(a__       )}"""       )
							print(f"""Post-order Traversal: {postorder(a__       )}"""   ,			"""\n"""       )

							print(f"""Height of Tree: {height(a__       )}"""   ,			"""\n"""       )

							print("""Complete Level Order Traversal: """       )
							print(level_order(a__       )   ,			"""\n"""       )

							print("""Level-wise order Traversal: """       )

							for level in range(1   ,			height(a__       ) + 1       ):
														print(f"""Level {level}:"""   ,			get_nodes_from_left_to_right(a__   ,			level=a__       )       )

							print("""\nZigZag order Traversal: """       )
							print(zigzag(a__       )       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					main()




