From a9db4aab4257c8651dec7a3b8b0716dc472afddf Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Thu, 7 Sep 2023 20:52:42 +0300
Subject: Solved 4 problems in the last div3(Round895) and deleted binaries

---
 codeforces/UnitedWeStand/main             | Bin 0 -> 52896 bytes
 codeforces/UnitedWeStand/main.cpp         | 158 ++++++++++++++++++++++++++++++
 codeforces/UnitedWeStand/main_input0.txt  |  11 +++
 codeforces/UnitedWeStand/main_output0.txt |  13 +++
 4 files changed, 182 insertions(+)
 create mode 100755 codeforces/UnitedWeStand/main
 create mode 100755 codeforces/UnitedWeStand/main.cpp
 create mode 100644 codeforces/UnitedWeStand/main_input0.txt
 create mode 100644 codeforces/UnitedWeStand/main_output0.txt

(limited to 'codeforces/UnitedWeStand')

diff --git a/codeforces/UnitedWeStand/main b/codeforces/UnitedWeStand/main
new file mode 100755
index 0000000..745e96c
Binary files /dev/null and b/codeforces/UnitedWeStand/main differ
diff --git a/codeforces/UnitedWeStand/main.cpp b/codeforces/UnitedWeStand/main.cpp
new file mode 100755
index 0000000..81115d9
--- /dev/null
+++ b/codeforces/UnitedWeStand/main.cpp
@@ -0,0 +1,158 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = 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};
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p);
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m);
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s);
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s);
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p) {
+  os << "(" << p.first << ", " << p.second << ")";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
+  os << "{";
+  for (size_t i = 0; i < vec.size(); ++i) {
+    if (i > 0)
+      os << ", ";
+    os << vec[i];
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+void dbg() { cerr << "\n"; }
+
+template <typename T, typename... TS> void dbg(T val, TS... vals) {
+  cerr << val << " ";
+  dbg(vals...);
+}
+
+/* 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;
+  int mn = INT_MAX;
+  mpii fq;
+  vi v(n);
+  for (auto &x : v) {
+    cin >> x;
+    fq[x]++;
+    mn = min(mn, x);
+  }
+  if (fq[mn] == n) {
+    cout << -1 << '\n';
+    return;
+  }
+  cout << fq[mn] << ' ' << n - fq[mn] << '\n';
+  sort(all(v));
+  for (int i = 0; i < n; i++) {
+    if (v[i] == mn) {
+      cout << v[i] << ' ';
+    }
+  }
+  cout << '\n';
+  for (int i = 0; i < n; i++) {
+    if (v[i] != mn) {
+      cout << v[i] << ' ';
+    }
+  }
+  cout << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/UnitedWeStand/main_input0.txt b/codeforces/UnitedWeStand/main_input0.txt
new file mode 100644
index 0000000..3c1b805
--- /dev/null
+++ b/codeforces/UnitedWeStand/main_input0.txt
@@ -0,0 +1,11 @@
+5
+3
+2 2 2
+5
+1 2 3 4 5
+3
+1 3 5
+7
+1 7 7 2 9 1 4
+5
+4 8 12 12 4
diff --git a/codeforces/UnitedWeStand/main_output0.txt b/codeforces/UnitedWeStand/main_output0.txt
new file mode 100644
index 0000000..16a8fd3
--- /dev/null
+++ b/codeforces/UnitedWeStand/main_output0.txt
@@ -0,0 +1,13 @@
+-1
+3 2
+1 3 5
+2 4
+1 2
+1
+3 5
+2 5
+1 1
+2 4 7 7 9
+3 2
+4 8 4
+12 12
-- 
cgit v1.2.3