From e06d662de2a01673ce6151ef66d2aa00b271a44c Mon Sep 17 00:00:00 2001
From: Santo Cariotti <dcariotti24@gmail.com>
Date: Mon, 20 Jul 2020 12:26:37 +0200
Subject: feat: add exercises of 20/07/2020 exam

---
 .../exercises/exam_20_07_20/ex1.cpp                | 39 ++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 I_anno/Programmazione_2/exercises/exam_20_07_20/ex1.cpp

(limited to 'I_anno/Programmazione_2/exercises/exam_20_07_20/ex1.cpp')

diff --git a/I_anno/Programmazione_2/exercises/exam_20_07_20/ex1.cpp b/I_anno/Programmazione_2/exercises/exam_20_07_20/ex1.cpp
new file mode 100644
index 0000000..4f08a74
--- /dev/null
+++ b/I_anno/Programmazione_2/exercises/exam_20_07_20/ex1.cpp
@@ -0,0 +1,39 @@
+#include<iostream>
+#include<sstream>
+#include<fstream>
+#include<vector>
+
+using namespace std;
+int insertionsort(vector<int>& a, int n) {
+    int c = 0;
+    for(int i = 1; i < n; ++i) {
+        int j = i-1;
+        int key = a[i];
+        while(j > -1 && a[j] > key) {
+            swap(a[j+1], a[j]);
+            --j;
+            c++;
+        }
+        a[j+1] = key;
+    }
+    return c;
+}
+int main() {
+    ifstream in("input.txt");
+    ofstream out("output.txt");
+
+    for(int ts = 0; ts < 100; ++ts) {
+        int N;
+        in >> N;
+        int a, b;
+        vector<int> v;
+        for(int i = 0; i < N; ++i) {
+            in >> a >> b;
+            v.push_back(a+b);
+        }
+        out << insertionsort(v, v.size()) << endl;
+    }
+    in.close();
+    out.close();
+    return 0;
+}
-- 
cgit v1.2.3-18-g5258