[백준,c++] 10818번 - 최소, 최대

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

10818번: 최소, 최대

1번풀이

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

int main() {

    int N;
    cin >> N;
    priority_queue<int, vector<int>, greater<int>>pq1; //작은 순서대로
    priority_queue<int, vector<int>,less<int>>pq2; //큰 순서대로

    for (int i = 0; i < N; i++) {
        int number;
        cin >> number;
        pq1.push(number);
        pq2.push(number);
    }
    cout << pq1.top() <<"\n"<< pq2.top();


}

2번풀이

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

int main() {
    int N;
    cin >> N;
    vector<int> v;

    for (int i = 0; i < N; i++) {
        int number;
        cin >> number;
        v.push_back(number);
    }
    int max = v[0];
    int min = v[0];
    for (int i = 0; i < N; i++) {
        if (max <= v[i]) max = v[i];
        if (min >= v[i]) min = v[i];
    }
    cout << min << " " << max;

}