[C++] 백준 10818번 최소, 최대

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {

	int testCase, num;
	cin >> testCase;

	vector<long long> numArr;
	for (int i = 0; i < testCase; i++) {
		cin >> num;
		numArr.push_back(num);
	}
	int len = numArr.size();
	sort(numArr.begin(), numArr.end());
	cout << numArr[0] << " " << numArr[len - 1] << endl;
	
	numArr.clear();

	return 0;
}