fenychn0206/OI-Codes
1
0
Fork 0
mirror of https://github.com/wczffl-503/OI-Codes.git synced 2025-07-08 02:13:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update: Rename folder name to XSMOJ

Browse Source
This commit is contained in:
Frederick Chen
2025-02-14 02:44:20 +00:00
parent 394e431a4a
commit c8863a5850
243 changed files with 11 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
XSMOJ/最小数和最大数（数组实现）.cpp Normal file
View 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;
}