1851B - Parity Sort - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
bool static compare(int a,int b) {return a<b;}
void p(vector<int>a){ for (auto i: a) cout<<i<< " "; cout<<endl;}
int main(){
    int t  ;
    cin>>t;
    for(int i=0;i<t;i++){
        int n  ;
        cin>> n ;
        
        vector<int>nums(n);
        
        // int small =INT_MAX;
        for(int i=0;i<nums.size();i++){
            cin>>nums[i];
            // small = min (small,nums[i]);
        }
        if(n==1) {
            cout<< "YES" << endl;
            continue;
        }
        vector<int>temp = nums;
        int t=0;
        sort(temp.begin(),temp.end());
        for(int i =0 ;i<n;i++){
            if(nums[i]%2 != temp[i]%2) {
                t=1;
                break;
            }
        }
        if(t) cout<< "NO"<<endl;
        else cout<<"YES"<<endl;
    }

}