-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path01260 Sales.cpp
44 lines (44 loc) · 977 Bytes
/
01260 Sales.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <limits>
#define iter(a,b,c,d) for(a = b; a < c; a+=d)
#define ited(a,b,c,d) for(a = b; a > c; a-=d)
#define li long int
#define uli unsigned li
#define ll long li
#define ull unsigned ll
#define si(a) scanf("%d",&a)
#define sli(a) scanf("%ld",&a)
#define sll(a) scanf("%lld",&a)
#define slu(a) scanf("%llu",&a)
#define sf(a) scanf("%f",&a)
#define slf(a) scanf("%lf",&a)
#define PI 3.1415926
using namespace std;
int main()
{
/*freopen("1in.txt", "r", stdin);
freopen("1out.txt", "w", stdout);*/
int t; si(t);
ll ans;
int i,j,n;
while(t--)
{
si(n);
int arr[n];
ans = 0;
iter(i,0,n,1){si(arr[i]);}
iter(i,0,n,1){iter(j,0,i,1){if(arr[i]>=arr[j])ans++;}}
printf("%lld\n",ans);
}
return 0;
}