c_cpp 最便宜的子阵列

Posted 2021-05-14

#include<bits/stdc++.h>
using namespace std;

int main(){
    int t;
    cin >> t;
    while(t>0){
        int n;
        cin >> n;
        int a[n];
        for (int i=0;i<n;i++){
            cin >> a[i];
        }
        int min=INT_MAX, max=INT_MIN;
        for (int i=0;i<n;i++){
            if(a[i] < min)
                min =a[i];
            if (a[i]>max)
                max = a[i];
        }
        cout <<min+max;
    }
}