accenture_15.java

/* 
Problem Statement 

You are required to input the size of the matrix then the elements of matrix, then you have to divide the main matrix in two sub matrices (even and odd) in such a way that element at 0 index will be considered as even and element at 1st index will be considered as odd and so on. then you have sort the even and odd matrices in ascending order then print the sum of second largest number from both the matrices

Example

enter the size of array : 5
enter element at 0 index : 3
enter element at 1 index : 4
enter element at 2 index : 1
enter element at 3 index : 7
enter element at 4 index : 9
Sorted even array : 1 3 9
Sorted odd array : 4 7

7
*/
import java.util.*;
public class accenture_15 {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        System.out.print("enter the size of array: ");
        int n=sc.nextInt();
        int a[]=new int[n];
        for(int i=0;i<n;i++){
            System.out.print("enter elements at "+i+" index : ");
            a[i]=sc.nextInt();
            System.out.print("\n");
        }
        ArrayList<Integer> even=new ArrayList<>();
        ArrayList<Integer> odd=new ArrayList<>();
        for(int i=0;i<n;i++){
            if(i==0||i%2==0)
            even.add(a[i]);
            else
            odd.add(a[i]);
        }
        Collections.sort(even);
        System.out.println("Sorted even array ");
        for(int i:even){
            System.out.print(i+" ");
        }
        System.out.print("\n");
        Collections.sort(odd);
        System.out.println("Sorted odd array ");
        for(int i:odd){
            System.out.print(i+" ");
        }
        System.out.print("\n");
        System.out.println((even.get(even.size()-2))+(odd.get(odd.size()-2)));
        sc.close();
    }
}