mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-08 02:13:51 +08:00
更新了许多
This commit is contained in:
20
最小数和最大数(数组实现).cpp
Normal file
20
最小数和最大数(数组实现).cpp
Normal file
@ -0,0 +1,20 @@
|
||||
#include <iostream>
|
||||
using namespace std;
|
||||
int main(){
|
||||
int n;
|
||||
int max=-100000,min=100000;
|
||||
int a[100000];
|
||||
cin >>n;
|
||||
for(int i=0;i<n;i++){
|
||||
cin >>a[i];
|
||||
if(a[i]>=max){
|
||||
max=a[i];
|
||||
}
|
||||
if(a[i]<=min){
|
||||
min=a[i];
|
||||
}
|
||||
}
|
||||
cout <<min<<" "<<max;
|
||||
return 0;
|
||||
}
|
||||
|
Reference in New Issue
Block a user