summaryrefslogtreecommitdiff
path: root/1_anno/Programmazione_1/ex13.cc
diff options
context:
space:
mode:
authorSanto Cariotti <dcariotti24@gmail.com>2020-10-18 18:56:43 +0200
committerSanto Cariotti <dcariotti24@gmail.com>2020-10-20 09:08:52 +0200
commitf279107065146a4940f5e73602a1c3c09e58b31d (patch)
treefd892749637a8b6c5c31ccb80bba04ade76ab87a /1_anno/Programmazione_1/ex13.cc
parent4e063e32250312c38d5646840719b62429362b21 (diff)
chore: name of first year folder
Diffstat (limited to '1_anno/Programmazione_1/ex13.cc')
-rw-r--r--1_anno/Programmazione_1/ex13.cc45
1 files changed, 45 insertions, 0 deletions
diff --git a/1_anno/Programmazione_1/ex13.cc b/1_anno/Programmazione_1/ex13.cc
new file mode 100644
index 0000000..f9f19fa
--- /dev/null
+++ b/1_anno/Programmazione_1/ex13.cc
@@ -0,0 +1,45 @@
+#include <iostream>
+#include <memory>
+#include <algorithm>
+#include <vector>
+using namespace std;
+
+template<int N, int K>
+unique_ptr<double[]> func(int (&A)[K][N], int (&B)[N][K]) {
+ auto arr = unique_ptr<double[]>(new double{K});
+ for(int i = 0; i < K; ++i) {
+ vector<int> t;
+ int sum = 0;
+ for(int j = 0; j < N; ++j) {
+ t.push_back(B[j][i]);
+ sum+=A[i][j];
+ }
+
+ double media = static_cast<double>(sum)/N;
+ auto min_num = min_element(begin(t), end(t));
+ arr[i] = media - *min_num;
+ }
+
+ return arr;
+}
+
+int main() {
+ const int N2 = 3, K2 = 2;
+ int A[K2][N2] = {
+ {3, 7, 10},
+ {5, 12, 32},
+ };
+ int B[N2][K2] = {
+ {12, 10},
+ {15, 17},
+ {8, 0},
+ };
+ auto x = func(A, B);
+
+ for(int i = 0; i < K2; ++i)
+ cout << x[i] << ' ';
+
+ cout << endl;
+
+ return 0;
+}