People need to spend time lining up when entering some popular performance venue. Assume each one in the line of entering a performance venue is assigned a sequential number. One with a smaller sequential number is supposed to have a higher priority to enter the place. For example, if someone’s number is 1, then he should be the first to enter. However, some people with the lower priority might cut in the line, and it makes the law-abiding people complain.

Suppose everyone in the line queue has a complaint value 0 initially. For a person in the queue, if the people in line ahead of him all have greater priority than him, the final complaint value is 0. Else if k people in line ahead of him with priorities lower than him, his compliant value increases by k. The compliant value of a queue is the sum of the values of all individuals.

Please calculate the complaint value of the given line queue.

參加熱門的演唱會或週年慶的百貨公司等一些熱門活動，因人數眾多，常常需要要排隊進場。假設在進場的排隊隊伍中，每個人都有一個順序號碼，而號碼較小的消費者擁有較高的優先權進場。比方說，如果有人拿到的的順序號碼是1，那麼他應該可以第一個進場。然而，當隊伍有人插隊時，低優先權的人會排在高優先權的前面，這會激起守法的排隊者的抱怨。

假設隊伍中每個人都有一個起始值為0的抱怨值。若排在他前面的人，其優先權都比他大，則抱怨值保持為0；而當他前面有k個優先權比他低的人插隊進來時，則他的抱怨值增加k。一個排隊隊伍的抱怨值設為所有排隊人員的抱怨值總和。

請計算排隊隊伍的抱怨值。