human
k | Returns k - th missing element . It returns - 1 if no k is more than number of missing elements ..
insert all elements of given sequence b [ ] ..
Traverse through increasing sequence and keep track of count of missing numbers ..
Driver code"
How can the above be solved in Python?

Give me a code to k and the other steps required?
assistant
#Here is code to k and the other steps required.
 def find ( a , b , k , n1 , n2 ) :
	s = set ( )
	for i in range ( n2 ) :
		s . add ( b [ i ] )
	missing = 0
	for i in range ( n1 ) :
		if a [ i ] not in s :
			missing += 1
		if missing == k :
			return a [ i ]
	return - 1
a = [ 0 , 2 , 4 , 6 , 8 , 10 , 12 , 14 , 15 ]
b = [ 4 , 10 , 6 , 8 , 12 ]
n1 = len ( a )
n2 = len ( b )
k = 3
print ( find ( a , b , k , n1 , n2 ) )