Lang:Java
Edit12345678910111213141516171819202122232425262728293031public class Main {static int count = 0;public static void main(String[] args) {java.util.Scanner input = new java.util.Scanner(System.in);int N = input.nextInt();int[] array = new int[N];for(int i = 0;i < array.length;i++) {array[i] = input.nextInt();}mergeSort(array,0,N - 1);System.out.println(count);}public static void mergeSort(int[] array,int p,int r) {if(p < r) {int q = (p + r) / 2;mergeSort(array,p,q);mergeSort(array,q+1,r);merge(array,p,q,r);}}public static void merge(int[] array,int p,int q,int r) {int n1 = q - p + 1;int n2 = r - q;int[] A = new int[n1];int[] B = new int[n2];System.arraycopy(array,p,A,0,n1);System.arraycopy(array,q+1,B,0,n2);int i = 0, j = 0,k = p;while(i < n1 && j < n2) {if(A[i] <= B[j])