题解 | 求最大最小数
求最大最小数
https://www.nowcoder.com/practice/82e5ff335eeb486aab359767895cc7b4
#include <iostream>
#include <vector>
using namespace std;
int cmp(const void* a, const void* b) {
return *(int*)a - *(int*)b;
}
int main() {
int n;
vector<int> arr(10000);
int max, min;
while (cin >> n) {
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
max = arr[0];
min = arr[0];
for (int i = 0; i < n; i++) {
if (min > arr[i]) min = arr[i];
if (max < arr[i]) max = arr[i];
}
cout << max << " " << min << endl;
}
}
// 64 位输出请用 printf("%lld")
查看19道真题和解析