Skip to content

Commit 2ebf869

Browse files
committed
c++ code solution for average flex
1 parent 7e13346 commit 2ebf869

File tree

1 file changed

+54
-0
lines changed

1 file changed

+54
-0
lines changed

averageflex.cpp

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
//shree ganeshay namah
2+
#include <bits/stdc++.h>
3+
using namespace std;
4+
#define ll long long
5+
#define pi (3.141592653589)
6+
#define mod 1000000007
7+
#define ll long long
8+
#define float double
9+
#define pb push_back
10+
#define mp make_pair
11+
#define ff first
12+
#define ss second
13+
#define all(c) c.begin(), c.end()
14+
#define min3(a, b, c) min(c, min(a, b))
15+
#define min4(a, b, c, d) min(d, min(c, min(a, b)))
16+
#define rrep(i, n) for(int i=n-1;i>=0;i--)
17+
#define rep(i,n) for(int i=0;i<n;i++)
18+
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
19+
20+
21+
int main()
22+
{
23+
24+
25+
int t;
26+
cin>>t;
27+
while(t--)
28+
{
29+
int n, cv = 0, qw = 0, po = 0;
30+
cin >> n;
31+
std::vector<int> a(n);
32+
for (int i = 0; i < n; i++)
33+
cin >> a[i];
34+
for (int j = 0; j < n; j++)
35+
{
36+
for (int i = 0; i < n; i++)
37+
{
38+
if (a[j] >= a[i]){
39+
cv++;
40+
}
41+
else{
42+
qw++;
43+
}
44+
45+
}
46+
if (cv > qw)
47+
po++;
48+
cv = 0;
49+
qw = 0;
50+
}
51+
cout << po << endl;
52+
}
53+
return 0;
54+
}

0 commit comments

Comments
 (0)