题解 | 求最大最小数

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <map>
#include<algorithm>
using namespace std;

int main() {
    int n;
    scanf("%d", &n);
    int arr[10001];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    int maxN = 0, minN = 0;
    sort(arr, arr + n);
    maxN = arr[n - 1];
    minN = arr[0];
    printf("%d %d\n", maxN, minN);

    return 0;
}