INVERSION COUNT - Wrong Answer

#1

Hi @abhishek_trigunait - I am trying to solve inversion count problem but i am getting wrong answer .
Could you please let me know what exactly i am missing .

https://ide.codingblocks.com/#/s/18255
https://online.codingblocks.com/player/2872/content/863?s=376

#2

Question link missing

#3

@abhishek_trigunait - Question link is there in first comment :slight_smile: . I am mentioning the same here
https://online.codingblocks.com/player/2872/content/863?s=376

#4

Message someone from messenger.com and send me the link of that message. Will I be able to open it?:smile:

#5

I am not sure exactly which link i should send here :frowning: . I think as this question belongs to particular course that’s why its not accessible . So in that case how can we send the test link .

I am copy pasting the same question below .

INVERSION COUNT
You are given an array A find out number of pairs (i,j) in array A such that A[i] > A[j] and i < j.

Input Format:
The first line consists of number of test cases t. Each test case consists of integer N followed by N space separated integers.

Constraints:
1 <= N <= 100000 1 <= t <= 20 0 <= A[i] <= 100000000

Output Format
The number of inversions in array

Sample Input
2 4 1 2 4 3 3 3 2 1

Sample Output
1 3

#6 
long stall = sc.nextLong();
  int cow = sc.nextInt();
  int stallArr [] = new int [(int)stall];
  for(int i = 0 ; i < stall ; i++){
    stallArr[i] = sc.nextInt();
  }

Is this really your driver function :face_with_raised_eyebrow:

#7

by mistakenly i had given you the solution link for different problem . sorry for that

https://ide.codingblocks.com/#/s/18384 (this is the correct one).

Yes that’s the driver function for different problem (is there something wrong)?