DCEPC206 - Its a Murder!

Once detective Saikat was solving a murder case. While going to the crime scene he took the stairs and saw that a number is written on every stair. He found it suspicious and decides to remember all the numbers that he has seen until now. While remembering the numbers he found that he can find some pattern in those numbers. So he decides that for each number on the stairs he will note down the sum of all the numbers previously seen on the stairs which are smaller than the present number. Calculate the sum of all the numbers written on his notes diary.

Input

First line gives T, number of test cases. 2T lines follow.

First line gives you the number of stairs N.

Next line gives you N numbers written on the stairs.

Output

For each test case output one line giving the final sum for each test case.

Constraints

T ≤ 10
1 ≤ N ≤ 105

All numbers will be between 0 and 106.

Example

Input:
1
5
1 5 3 6 4

Output: 15

Added by:dce coders
Date:2012-02-26
Time limit:1.259s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own Problem

hide comments
2016-10-19 00:15:27
1
10
9 9 10 10 10 9 9 10 10 10
output 162
2016-08-18 09:05:29 Gaurav Dahima
my solution passed every possible test cases, still getting WA, Please have a look, solution id is 17528935

Edit: finally AC. Overflow, due to (long long)(L[i]*(n2-j)) instead of (long long)L[i]*(n2-j).

Last edit: 2016-08-18 12:59:44
2016-08-03 16:02:04
use LONG LONG INT in cpp
2016-07-05 13:33:25
BITS !! AC !!
2016-04-25 07:44:50 truetubelight
Why does the tag say binary search if its using merge sort or BIT?
2016-03-14 13:47:06 gautam
plz help i am getting WA ...need more testcases:(
2016-01-23 17:06:35 minhthai
BIT cannot pass in java :(
2016-01-13 19:21:22
just a minor variation of INVCNT problem... got AC in 0.10s without BIT... just used merge sort (along with long long int) :) (took me 1 hour)

Last edit: 2016-01-13 19:22:25
2016-01-05 16:14:13
easy if know inversion count method
using segment tree a nice question took 4 hours to understand : (
2016-01-01 18:04:27 NEXES
use long long cost me 3 WA....!!!!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.