C ++ Program to find kth element from two sorted arrays Time Complexity : O ( log k )
#include <iostream> NEW_LINE using namespace std ; int kth ( int arr1 [ ] , int m , int arr2 [ ] , int n , int k ) { if ( k > ( m + n ) k < 1 ) return -1 ;