Sorting

input/code.cpp:58:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

#include <bits/stdc++.h>
//#pragma GCC optimize "O3"
///if ((double) ((double)(clock() - cl)/(double)CLOCKS_PER_SEC)>1.85) { break;}
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define double long double
#define ft first
#define sc second
#define pb push_back
#define e '\n'
#define booost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
#define all(x) (x).begin(),(x).end()
#define file(x) freopen(string(string((x)) + ".in").c_str(), "r", stdin); freopen(string(string((x)) + ".out").c_str(), "w", stdout);
#define GG cout << " OPA " << '\n';

using namespace std;
using namespace __gnu_pbds;

typedef pair <int, int> pi;
typedef tree <pi, null_type, less<pi>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int N = 100 + 5;
const int K = 10;
const int KK = 20;
const int INF = 1e15;
const double d_INF = 2000000000.0;
const double EPS = 1e-17;
const int MOD = 1e9 + 7;
const int LOG = 30;

int a[N];
int b[N];

void solve() {
    int n;
    cin >> n;
    map <int, int> pos;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
    }
    int ans = 0;
    for (int i = 1; i < n; i ++) {
        if (a[i + 1] + 1 == a[i]) ans ++;
    }
    if (ans) cout << "NO\n";
    else cout << "YES\n";
    /*sort (b + 1, b + n + 1);
    bool ok = true;
    for (int i = 1; i <= n; i ++) {
        if (a[i] == b[i]) continue;
        if (pos[b[i]] == i + 1) {

        }
    }*/

}
main () {
    int test = 1;
    booost;
    cin >> test;
    while (test --) {
        solve();
    }
}

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