蓝桥杯 ADV-162 算法提高 题目1 最大最小值

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

int cmp(int a, int b) { return a < b; }

int main() {
int n;
cin >> n;
int *a = new int
;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a+n, cmp);
cout << a[n - 1] << " " << a[0];
delete [] a;
return 0;
}