BOJ 10818 최소, 최대(C++, 1차원 배열)

#define _CRT_SECURE_NO_WARNINGS
#include    <iostream>
#include	<math.h>
#include	<stdlib.h>
using namespace std;


int main()
{
	int n, search_n;
	int *arr;
	int count = 0;

	scanf("%d", &n);
	arr = (int*)malloc(n * sizeof(int));

	for (int i = 0; i < n; ++i)
		scanf("%d", &arr[i]);

	
    int min = 1000000;
    int max = -1000000;
	for (int i = 0; i < n; ++i)
    {
        if (min > arr[i])
			min = arr[i];
        if (max < arr[i])
            max = arr[i];
    }
	printf("%d %d\n", min, max);


	return 0;
}

1차원 배열 사용하는 문제.
쉬워서 따로 볼 것은 없을것 같지만 기록용으로.