diff options
Diffstat (limited to 'codeforces/cubesShuffling')
| -rwxr-xr-x | codeforces/cubesShuffling/main | bin | 0 -> 44632 bytes | |||
| -rw-r--r-- | codeforces/cubesShuffling/main.cpp | 41 | ||||
| -rw-r--r-- | codeforces/cubesShuffling/main_input0.txt | 5 | ||||
| -rw-r--r-- | codeforces/cubesShuffling/main_output0.txt | 4 |
4 files changed, 50 insertions, 0 deletions
diff --git a/codeforces/cubesShuffling/main b/codeforces/cubesShuffling/main Binary files differnew file mode 100755 index 0000000..d5ae401 --- /dev/null +++ b/codeforces/cubesShuffling/main 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]; + } + } +} diff --git a/codeforces/cubesShuffling/main_input0.txt b/codeforces/cubesShuffling/main_input0.txt new file mode 100644 index 0000000..3150c53 --- /dev/null +++ b/codeforces/cubesShuffling/main_input0.txt @@ -0,0 +1,5 @@ +2 +3 +1 2 3 +5 +4 5 2 1 3 diff --git a/codeforces/cubesShuffling/main_output0.txt b/codeforces/cubesShuffling/main_output0.txt new file mode 100644 index 0000000..980ed86 --- /dev/null +++ b/codeforces/cubesShuffling/main_output0.txt @@ -0,0 +1,4 @@ +Case 1: +2 1 3 +Case 2: +4 2 1 3 5 |
