From c52b36c6a37fdb1d1de146d3939cb42e2c691f44 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Sat, 5 Nov 2022 01:28:02 +0200
Subject: Solved 6 problem in filtrationContest and restructured the repo

---
 codeforces/cubesShuffling/main.cpp | 41 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 codeforces/cubesShuffling/main.cpp

(limited to 'codeforces/cubesShuffling/main.cpp')

diff --git a/codeforces/cubesShuffling/main.cpp b/codeforces/cubesShuffling/main.cpp
new file mode 100644
index 0000000..20c107c
--- /dev/null
+++ b/codeforces/cubesShuffling/main.cpp
@@ -0,0 +1,41 @@
+#include<bits/stdc++.h>
+#include <functional>
+
+using namespace std;
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+  freopen("cubes.in", "r", stdin);
+	int tt;
+	cin >> tt;
+  int cnt = 0;
+	while(tt--) {
+    cnt++;
+    int n;
+    cin >> n;
+    vector<int> v(n);
+    vector<int> ans(n);
+    for (auto &x : v) cin >> x;
+    sort(v.begin(), v.end());
+    cout << "Case " << cnt << ":\n";
+    int j = 0;
+    if (n & 1) {
+      ans[n / 2] = v[0];
+      for(int i = 0; i < n / 2; i++) {
+        ans[n - 1 - i] = v[(n - 1) - j]; // 4 2 // 4
+        ans[i] = v[(n - 2) - j]; // 3 1 / 0
+        j += 2;
+      }
+    } else {
+      for(int i = 0; i < n / 2; i++) {
+        ans[n - 1 - i] = v[(n - 1) - j];
+        ans[i] = v[(n - 2) - j];
+        j += 2;
+      }
+    }
+    for (int i = 0; i < n; i++) {
+      cout << ans[i] << " \n"[i == n - 1];
+    }
+	}
+}
-- 
cgit v1.2.3