aboutsummaryrefslogtreecommitdiff
path: root/codechef/ReversalSorting/main.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-06-26 14:24:52 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-06-26 14:24:52 +0200
commit13ae5b6eaaa4779009633eda567b4f1735669ac3 (patch)
tree477cf2b9b20f8a0c939248960458e720faecdf42 /codechef/ReversalSorting/main.cpp
parent7c3f32fab3b1a9d628d6856e7a923eb3c3b1ce5f (diff)
downloadcompetitive-programming-13ae5b6eaaa4779009633eda567b4f1735669ac3.tar.xz
competitive-programming-13ae5b6eaaa4779009633eda567b4f1735669ac3.zip
partially solved reversal sorting on codechef
Diffstat (limited to 'codechef/ReversalSorting/main.cpp')
-rw-r--r--codechef/ReversalSorting/main.cpp23
1 files changed, 23 insertions, 0 deletions
diff --git a/codechef/ReversalSorting/main.cpp b/codechef/ReversalSorting/main.cpp
new file mode 100644
index 0000000..1a88262
--- /dev/null
+++ b/codechef/ReversalSorting/main.cpp
@@ -0,0 +1,23 @@
+#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, x;
+ cin >> n >> x;
+ vector<int> v(n);
+ for(int &i : v) cin >> i;
+ vector<vector<int>> sa;
+ // 1 2 2 3 2 2 3 3
+ for(int i = 0; i < v.size(); i++) {
+ for(int j = 0; j < v.size(); j++){
+
+ }
+ }
+ }
+}