From 5b2d58b6f42a19b4c779627d71a1158e4376699d Mon Sep 17 00:00:00 2001
From: Omar Magdy <omar.professional8777@gmail.com>
Date: Thu, 2 Jun 2022 14:06:48 +0200
Subject: Solved Average flex from codechef

---
 codechef/averageFlex/inp      |   7 +++++++
 codechef/averageFlex/main     | Bin 0 -> 44784 bytes
 codechef/averageFlex/main.cpp |  35 +++++++++++++++++++++++++++++++++++
 3 files changed, 42 insertions(+)
 create mode 100644 codechef/averageFlex/inp
 create mode 100755 codechef/averageFlex/main
 create mode 100644 codechef/averageFlex/main.cpp

(limited to 'codechef/averageFlex')

diff --git a/codechef/averageFlex/inp b/codechef/averageFlex/inp
new file mode 100644
index 0000000..999a8d9
--- /dev/null
+++ b/codechef/averageFlex/inp
@@ -0,0 +1,7 @@
+3
+3
+100 100 100
+3
+2 1 3
+4
+30 1 30 30
diff --git a/codechef/averageFlex/main b/codechef/averageFlex/main
new file mode 100755
index 0000000..38c12de
Binary files /dev/null and b/codechef/averageFlex/main differ
diff --git a/codechef/averageFlex/main.cpp b/codechef/averageFlex/main.cpp
new file mode 100644
index 0000000..2acb1f2
--- /dev/null
+++ b/codechef/averageFlex/main.cpp
@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    int n;
+    cin >> n;
+    vector<int> v(n);
+    for (int &x : v)
+      cin >> x;
+    map<int, int> low;
+    map<int, int> high;
+    for (int i = 0; i < v.size(); i++) {
+      for (int j = 0; j < v.size(); j++) {
+        if (v[j] <= v[i]) {
+          high[v[i]]++;
+        } else {
+          low[v[i]]++;
+        }
+      }
+    }
+    int count = 0;
+    for(int x : v) {
+      if(low[x] < high[x]) {
+        count++;
+      }
+    }
+    cout << count << endl;
+  }
+}
-- 
cgit v1.2.3