L1-7 天梯赛的善良 (20 分)

#include<iostream>

using namespace std;

int main()
{
	int n;
	scanf("%d", &n);
	
	int min_v = 1e7, max_v = 0;
	int min_c = 0, max_c = 0;

	while (n--)
	{
		int x;
		scanf("%d", &x);
		if (x < min_v)min_v = x, min_c = 1;
		else if (x == min_v)min_c++;

		if (x > max_v)max_v = x, max_c = 1;
		else if (max_v == x) max_c++;
	}

	printf("%d %d\n", min_v, min_c);
	printf("%d %d\n", max_v, max_c);
	
	return 0;
}