1259 - Even and Odd beecrowd solution in cpp

1259 - Even and Odd beecrowd solution in cpp

by ujjal roy

#include<bits/stdc++.h>

using namespace std;

main()

{

    int n,i,r;

    cin>>n;

    vector<int>e,od;

    for(i=0;i<n;i++)

    {

        cin>>r;

        if(r%2==0) e.push_back(r);

        else od.push_back(r);

    }

    sort(e.begin(),e.end());

    sort(od.rbegin(),od.rend());

    for(i=0;i<e.size();i++) cout<<e[i]<<endl;

    for(i=0;i<od.size();i++) cout<<od[i]<<endl;

    return 0;

}