백준/백준-C++
10818번: 최소, 최대
Beabletoet
2017. 6. 11. 13:41
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int n, *num;
scanf("%d", &n);
num = new int[n];
for (int i = 0; i < n; ++i)
scanf("%d", &num[i]);
printf("%d %d", *min_element(&num[0], &num[n]), *max_element(&num[0], &num[n]));
}