题解 | #数组排序#

#include using namespace std;

int main() {

int arr[6] = { 0 };
int len = sizeof(arr) / sizeof(int);
for (int i = 0; i < len; i++) {
    cin >> arr[i];
}
int min = arr[0];
int max = arr[0];
for(int i=0;i<len;i++){
    if(arr[i]<min){
        min = arr[i];
    }
    if(arr[i]>max){
        max = arr[i];
    }
}
// write your code here......
cout<<min<<" "<<max;
return 0;

}