这是擂台方法，遍历一遍不断替换地找到最大最小值，时间复杂度O(n)，空间复杂度O(n) 这是运用algorithm库中的函数*max_element()和*min_element()来做的或者也可以用sort()，记得加上*，因为返回类型为指针！

难死 没有代码 / / / / / / / / / / / / / / / / / / / / / / / / /// // / / / / / / / / / // / / / / //// / / / / // / / / / / /// /// / / / // / / / / / / / / / / / / / / / / / / / / | | | | | | | | | | | | | | | | | | --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- --- ---

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int a[n]; for(int i=0;i<n;i++){ cin>>a[i]; } int min=a[0]; int max=a[0]; for(int i=0;i<n;i++){ if(a[i]<min){ min=a[i]; } if(a[i]>max){ max=a[i]; } } cout<<min<<" "; cout<<max; return 0; }

#include <iostream> using namespace std; int main(){ int n; cin>>n; int max_num =-100; int min_num = 100; for(int i=1;i<=n;i++) { int num; cin>>num; if( num > max_num) { max_num = num; } if( num < min_num) { min_num = num; } }

#include <bits/stdc++.h> using namespace std; int n; int a[105]; void work() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; sort(a+1,a+1+n); cout<<a[1]<<" "<<a[n]; } int main() { work(); return 0; }

执行用时：8ms 内存消耗：1.49MB 击败了44.44%的用户 击败了33.33%的用户

又是用STL的一天

#include<bits/stdc++.h> using namespace std; int a[1005]; int main(){ int n; cin >> n; for(int i = 1;i <= n;i++) cin >> a[i]; sort(a+1,a+n+1); cout << a[1] << ' ' << a[n]; return 0; }

#include <bits/stdc++.h> using namespace std; #define int long long int a[100]; signed main() { ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } sort(a+1,a+n+1); cout<<a[1]<<" "<<a[n]<<endl; return 0; }

AC

#include<bits/stdc++.h> #include<iostream> using namespace std; int a[10001000];//定义数组 int main() { int n,ma=0,mi=999999;//最大开小点，最小开大点 cin>>n; for (int i=0;i<n;i++) { cin>>a[i]; if(a[i]>ma)ma=a[i];//如果a【i】大于ma ：赋值 if(a[i]<mi)mi=a[i];//如果a【i】小于mi ：赋值 } cout<<mi<<' '<<ma;//输出 return 0; }

#include<bits/stdc++.h> using namespace std; int a[1000000]; int main(){ int n; cin >> n; for(int i = 1;i<=n;i++){ cin >> a[i]; } sort(a+1,a+n+1); cout << a[1] << " " << a[n] << endl; return 0; }

n = int(input()) # 读取 n nums = list(map(int, input().split())) # 直接将输入转换为整数列表 初始化最小值和最大值 min_val = max_val = nums[0] 遍历列表，更新最小值和最大值 for num in nums[1:]: if num < min_val: min_val = num if num > max_val: max_val = num print(min_val, max_val) # 输出结果

#include<iostream> using namespace std; int main(){ int a,b,c=10000000,d=0; cin>>a; for(int i=1;i<=a;i++){ cin>>b; if(b<c){ c=b; } if(b>d){ d=b; } } cout<<c<<" "<<d; return 0; }