Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n,cnt=0;
- cin>>n;
- int arr[n];
- vector<int>v;
- for(int i=0; i<n; i++)
- {
- cin>>arr[i];
- v.push_back(arr[i]);
- }
- sort(v.begin(),v.end());
- for(int i=0; i<n; i++)
- {
- if((v[i+1]-v[i])==1 || (v[i+1]-v[i])==0)
- {
- cnt++;
- }
- }
- if(cnt==(n-1))
- {
- cout<<"YES"<<endl;
- vector<int>v1;
- for(int i=0; i<n; i++)
- {
- if(v[i]%2==0)
- v1.push_back(v[i]);
- }
- sort(v1.rbegin(),v1.rend());
- vector<int>v2;
- for(int i=0; i<n; i++)
- {
- if(v[i]%2!=0)
- v1.push_back(v[i]);
- }
- sort(v2.rbegin(),v2.rend());
- v1.insert( v1.end(), v2.begin(), v2.end() );
- for(int i=0; i<n; i++)
- {
- cout<<v1[i]<<" ";
- }
- }
- else
- cout<<"NO"<<endl;
- cout<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement