Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- #include<algorithm>
- using namespace std;
- ifstream fin("palindrom.in");
- ofstream fout("palindrom.out");
- int v[10005];
- int x[10000];
- int z[10005];
- int main()
- {
- int n, i, c=0, l=0, d=0, nueok=0, j=0;
- fin>>n;
- for(i=1; i<=n; i++)
- {
- fin>>v[i];
- }
- sort(v+1, v+n+1);
- v[n+1]=0;
- for(i=n ; i>=1; i--)
- {
- if(v[i]!=v[i+1])
- {
- c++;
- x[++l]=v[i];
- z[l]=i;
- }
- if(c==n/2)
- {
- break;
- }
- }
- for(i=1; i<=n; i++)
- {
- for(j=1; j<=n; j++)
- {
- if(i==z[j])
- {
- v[i]=-1;
- }
- }
- }
- c=0;
- for(i=1; i<=n; i++)
- {
- if(v[i]!=v[i+1] && v[i]!=-1)
- {
- x[++l]=v[i];
- }
- if(c==n-n/2)
- {
- break;
- }
- }
- j=0;
- for(i=1; i<=n/2; i++)
- {
- if(x[i]!=x[n-j])
- {
- nueok=1;
- break;
- }
- j++;
- }
- if(nueok==1)
- {
- fout<<-1;
- }
- else
- {
- for(i=1; i<=n; i++)
- {
- fout<<x[i]<<' ';
- }
- }
- fin.close();
- fout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement