查找两个排序数组中第K大的数

public class findK {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] arr1 = {1,4,6,7,10,20,21,22};
		int[] arr2 = {2,6,9,10,20,22,30};
		int k = 13;
		System.out.println(find(arr1,arr2,k));
	}
	
	private static int find(int[] arr1,int[] arr2,int k){
		int index1 = 0;
		int index2 = 0;
		int count = 0;
		int temp = 0;
		
		if(k>arr1.length+arr2.length){
			temp = -1;
		}else{
			while(count<k){
				if(arr1[index1]==arr2[index2]){
					temp = arr1[index1];
					
					if(index1==arr1.length-1){
					}else{
						index1++;
					}
					
					if(index2==arr2.length-1){
					}else{
						index2++;
					}
					
					count++;
					count++;
				}else{
					if(arr1[index1]>arr2[index2]){
						temp = arr1[index1];
						if(index2==arr2.length-1){
							if(index1==arr1.length-1){
							}else{
								index1++;
							}
						}else{
							index2++;
						}
						count++;
					}else{
						temp = arr2[index2];
						if(index1==arr1.length-1){
							if(index2==arr2.length-1){
							}else{
								index2++;
							}
						}else{
							index1++;
						}
						count++;
					}
				}
			}
		}	
		return temp;
	}
}