Solution

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int n, m;
	cin >> n >> m;
	int k[m];
	for (int i = 1; i <= m; i++) {
		cin >> k[i];
	}
	int maxx = 0, sum = 0;
	sort(k + 1, k + m + 1);
	for (int i = m; i >= 1; i--) {
		if (m - i + 1 <= n && k[i] * (m - i + 1) > maxx) {
			maxx = k[i] * (m - i + 1), sum = k[i];
		}
	}
	cout << sum << " " << maxx;
	return 0;
}