Custom Sort

//Author : Saurav Kalsoor
//Custom Sort


#include <bits/stdc++.h>

using namespace std;

vector<int> customSort(vector<int> arr, int n){

    vector<int> even, odd;
    for(int i = 0; i < n; i++){
        if(arr[i]%2 == 0)
            even.push_back(arr[i]);
        else
            odd.push_back(arr[i]);
    }


    sort(even.begin(), even.end());
    sort(odd.begin(), odd.end(), greater<int>());

    int x = 0, y = 0;
    for(int i = 0; i < n; i++){
        if(arr[i]%2 == 0){
            arr[i] = even[x];
            x++;
        }
        else{
            arr[i] = odd[y];
            y++;
        }
    }

    return arr;
}


int main(){
    int n;
    cin>>n;
    vector<int> arr(n);

    for(int i=0;i<n;i++)
        cin>>arr[i];

    vector<int> res = customSort(arr, n);

    for(int a : res)
        cout<<a<<" ";
    cout<<endl;
}