


'''simple docstring'''






from bisect import bisect
from itertools import accumulate


def    _snake_case  (	A					,       A					,       A					,       A			)		->       Dict:
							lowerCAmelCase__			  =      sorted(zip(A					,       A			)					,       key=lambda A			: x[0] / x[1]					,       reverse=A			)
							lowerCAmelCase__  ,   lowerCAmelCase__			  =      [i[0] for i in r], [i[1] for i in r]
							lowerCAmelCase__			  =      list(accumulate(A			)			)
							lowerCAmelCase__			  =      bisect(A					,       A			)
							return (
							    0
							    if k == 0
							    else sum(vl[:k]			) + (w - acc[k - 1]) * (vl[k]) / (wt[k])
							    if k != n
							    else sum(vl[:k]			)
							)


if __name__ == "__main__":
		import doctest

		doctest.testmod()



'''simple docstring'''






import re


def    _snake_case  (	A			)		->       bool:
							lowerCAmelCase__			  =      re.compile(R'''^(\+91[\-\s]?)?[0]?(91)?[789]\d{9}$'''			)
							if match := re.search(A					,       A			):
														return match.string == phone
							return False


if __name__ == "__main__":
		print(indian_phone_validator('''+918827897895'''))