백준 10818

#include <iostream>
#include <algorithm>

using namespace std;

int main(int argc, const char * argv[]) {

    ios_base::sync_with_stdio(0);

    int N;
    cin >> N;

    int array[1000001];

    for(int i = 0; i < N; i++) {
        cin >> array[i];
    }

    sort(array, array + N);		// 0 ~ N-1 범위 정렬

    cout << array[0] << " " << array[N - 1];

    return 0;

}

or)

#include <iostream>
using namespace std;

int main() {
    int min = 1000001;
    int max = -1000001;
    int n, input;
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> input;

        if (input < min) {
            min = input;
        }

        if (input > max) {
            max = input;
        }
    }

    cout << min << " " << max;

    return 0;
}