From 418399fef4556f890e965adb7b1e483fefbb4f0e Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 15 Apr 2024 17:19:02 +0200
Subject: Solved 2 problems on codeforces

---
 codeforces/MedianOfAnArray/main.cpp         | 73 +++++++++++++++++++++++++++++
 codeforces/MedianOfAnArray/main_input0.txt  | 17 +++++++
 codeforces/MedianOfAnArray/main_output0.txt |  8 ++++
 3 files changed, 98 insertions(+)
 create mode 100755 codeforces/MedianOfAnArray/main.cpp
 create mode 100644 codeforces/MedianOfAnArray/main_input0.txt
 create mode 100644 codeforces/MedianOfAnArray/main_output0.txt

(limited to 'codeforces/MedianOfAnArray')

diff --git a/codeforces/MedianOfAnArray/main.cpp b/codeforces/MedianOfAnArray/main.cpp
new file mode 100755
index 0000000..c7e8a47
--- /dev/null
+++ b/codeforces/MedianOfAnArray/main.cpp
@@ -0,0 +1,73 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() {
+  int n;
+  cin >> n;
+  vi v(n);
+  for (auto &x : v) {
+    cin >> x;
+  }
+  sort(all(v));
+  int m = ceil(n, 2);
+  int cnt = 1;
+  for (int i = m - 1; i < n - 1; i++) {
+    if (v[i] + 1 > v[i + 1]) {
+      cnt++;
+      v[i]++;
+    } else {
+      break;
+    }
+  }
+  cout << cnt << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/MedianOfAnArray/main_input0.txt b/codeforces/MedianOfAnArray/main_input0.txt
new file mode 100644
index 0000000..0b3e47b
--- /dev/null
+++ b/codeforces/MedianOfAnArray/main_input0.txt
@@ -0,0 +1,17 @@
+8
+3
+2 2 8
+4
+7 3 3 1
+1
+1000000000
+5
+5 5 5 4 5
+6
+2 1 2 3 1 4
+2
+1 2
+2
+1 1
+4
+5 5 5 5
diff --git a/codeforces/MedianOfAnArray/main_output0.txt b/codeforces/MedianOfAnArray/main_output0.txt
new file mode 100644
index 0000000..5054862
--- /dev/null
+++ b/codeforces/MedianOfAnArray/main_output0.txt
@@ -0,0 +1,8 @@
+1
+2
+1
+3
+2
+1
+2
+3
-- 
cgit v1.2.3