Sorting

#include <bits/stdc++.h>
#define X first
#define Y second
#define sz(a) (int)a.size()
#define pb push_back

using namespace std;
typedef long long ll;

void solve();

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}

int a[110];
int b[110];

void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b, b + n);
    for (int i = 0; i < n; ++i) {
        if (a[i] == b[i])
            continue;
        bool f = false;
        for (int j = i + 2; j < n - 1; ++j) {
            if (a[j] == b[i]) {
                swap(a[j], a[i]);
                swap(a[j + 1], a[i + 1]);
                f = true;
                break;
            }
        }
        if (!f) {
            cout << "NO\n";
            return;
        }
    }
    cout << "YES\n";
    return;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER