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

归类了 OJ，整理了一下

Browse Source
This commit is contained in:
Fengyi Chen
2024-02-15 22:38:30 +08:00
parent 76c1ecea65
commit 8dbc0861b2
231 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
XSM OJ 重庆小码王集团OJ/最小数和最大数（数组实现）.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;
}