void findMinMax(vector<int>& arr, pair<int, int>& mm) {
	int size = arr.size();
	int min = arr[0];
	int max = arr[0];
	for (size_t i = 0; i < size; i++)
	{
		if (min > arr[i]) min = arr[i];
		if (max < arr[i]) max = arr[i];
	}
	mm.first = min;
	mm.second = max;
}


int main() {
	vector<int> set1;
	vector<int> set2;
	pair<int, int> min_max;
	findMinMax(set2, min_max);
	int length = set1.size();
	for (size_t i = 0; i < length; i++)
	{
		if (set1[i] > min_max.first && set1[i] < min_max.second) cout << set1[i];
	}

	return 0;
}