Given two sorted arrays, merge them such that the elements are not repeated, Java

Language: Layout:

/*
Given two sorted arrays, merge them such that the elements are not repeated
Eg 1: Input:
        Array 1: 2,4,5,6,7,9,10,13
        Array 2: 2,3,4,5,6,7,8,9,11,15
       Output:
       Merged array: 2,3,4,5,6,7,8,9,10,11,13,15

import java.util.*;
import java.lang.*;

class Rextester
{  
    public static void main(String args[])
    {
        Scanner input=new Scanner(System.in);
        System.out.println("Enter the size of array one:");
        int arrayOneSize =input.nextInt();
        System.out.println("Enter the size of array two:");
        int arrayTwoSize =input.nextInt();
        int mergedArray[]=new int[arrayOneSize+arrayTwoSize];
        int mergedArrayTemp[]=new int[arrayOneSize+arrayTwoSize];
        int FinalmergedArray[]=new int[arrayOneSize+arrayTwoSize];
        System.out.println("Enter the elements of array one:");
        for(int i=0;i<arrayOneSize;i++)
        {
            mergedArray[i]=input.nextInt();
            mergedArrayTemp[i]=mergedArray[i];
        }
        
        System.out.println("Enter the elements of array two:");
        for(int i=arrayOneSize;i<arrayOneSize+arrayTwoSize;i++)
        {
            mergedArray[i]=input.nextInt();
            mergedArrayTemp[i]=mergedArray[i];
        }
        
        /*
        for(int i=0;i<arrayOneSize+arrayTwoSize;i++)        
            System.out.print(mergedArray[i]);
        */
        
        for(int i=0;i<(arrayOneSize+arrayTwoSize)-1;i++)
        {
            for(int j=i+1;j<(arrayOneSize+arrayTwoSize);j++)
            {
                if(mergedArrayTemp[i]==mergedArrayTemp[j])
                {
                    mergedArrayTemp[j]=-100;
                }
            }
        }
        
        System.out.println("Final merged array without duplicate:");
        int finalArrayIteration=0;
        for(int i=0;i<arrayOneSize+arrayTwoSize;i++)        
        {
            if(mergedArray[i]==mergedArrayTemp[i])
            {
                FinalmergedArray[finalArrayIteration]=mergedArray[i];
                finalArrayIteration++;
                System.out.print(mergedArray[i]);
            }
        }
    }
}

[ - ] Show input
Compilation time: 0.93 sec, absolute running time: 0.21 sec, cpu time: 0.24 sec, memory peak: 20 Mb, absolute service time: 1,16 sec

Given two sorted arrays, merge them such that the elements are not rep...