summaryrefslogtreecommitdiff
path: root/I_anno/Programmazione_1/ex01.cc
blob: 9183dec5408257716bd5dc7320ee9e77947daba7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <iostream>
#include <algorithm>
#include <vector>
#define K 2
#define N 3

using namespace std;

template<int KK, int NN>
bool func(int (&a)[KK][NN][NN], int w) {
	vector<int> list;
	for(int i = 0; i < KK; ++i) {
		list.clear();
		for(int j = 0; j < NN; ++j)
			list.push_back(a[i][j][j]);
			
		auto mm = minmax_element(begin(list), end(list));
		float media = (static_cast<float>(*mm.first)+static_cast<float>(*mm.second))/2;
		if(media <= w)
			return true;
	}
	
	return false;
}

int main() {
	int a[K][N][N] = {
		{
			{1, 2, 30},
			{1, 80, 3},
			{1, 2, 3},
		},
		{
			{1, 2, 30},
			{1, 20, 3},
			{1, 2, 3},
		}};
		
	cout << func(a, 5);

    return 0;
}