[백준][1차원배열] 10818번 : 최소, 최대 (C++)

https://www.acmicpc.net/problem/10818

10818번: 최소, 최대

풀이

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int n{};
    int min_val,max_val;
    cin >> n;
    vector<int> vec(n);
    for(int i{0}; i<n; ++i){
        cin >> vec[i];
    }
    
    cout <<  *min_element(vec.begin(),vec.end()) << " ";
    cout <<  *max_element(vec.begin(),vec.end()) << "\n";
    return 0;
}

 

min_element(vec.begin(), vec.end()) 를 써서 간단히 해결하자.