题解 | #求最大最小数#

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

int main() {
    int a;
    vector<int> v;
    while (cin >> a) { // 注意 while 处理多个 case
        vector<int> v2;
        for (int i = 0; i < a; i++) {
            int temp;
            cin >> temp;
            v2.push_back(temp);
        }
        sort(v2.begin(), v2.end());
        v.push_back(v2[v2.size() - 1]);
        v.push_back(v2[0]);
        v2.clear();
    }
    int count = 1;
    for (int i = 0; i < v.size(); i++) {
            cout << v[i];
            if(count==2)
            {
                cout<<endl;
                count = 0;
            }
            else {
                cout <<" ";
                count++;
            }
    }
}
// 64 位输出请用 printf("%lld")