Sorting

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define pii pair<int,int>
#define N 2000005
#define INF 1e9+5
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define fori(i,l,r) for(int i=l;i<=r;i++)
#define forf(i,r) fori(i,1,r)
#define rof(i,r,l) for(int i=r;i>=l;i--)
#define ll long long
#define int ll
using namespace std;

void solve(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    vector<int> tmp(n,0);
    while(tmp!=a){
        tmp=a;
        for(int i=1;i<=n;i++){
            int idx=find(a.begin(),a.end(),i)-a.begin();
            if(idx!=i-1&&abs(i-1-idx)>1&&idx<n-1){
                swap(a[idx],a[i-1]);
                swap(a[idx+1],a[i]);
            }
        }
    }
    if(is_sorted(all(a))){
        cout << "YES\n";
    }
    else{
        cout << "NO\n";
    }
}

int32_t main(){
	fastio()
	int t=1;
	cin >> t;
	while(t--){
		solve();
	}
}

Test 1

Group: 1, 2

Verdict: RUNTIME ERROR

free(): invalid pointer

Test 2

Group: 2

Verdict: RUNTIME ERROR

free(): invalid size

Test 3

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED