题解

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        vector<long long> a(n);  // 用long long避免溢出
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        long long x;
        cin >> x;
        long long min_a = *min_element(a.begin(), a.end());
        long long max_a = *max_element(a.begin(), a.end());
        if (x >= min_a && x <= max_a) {
            cout << "YES" << endl;
        } else {
            cout << "NO" << endl;
        }
    }
    return 0;
}